An Algorithm for Reading Dependencies from the Minimal Undirected Independence Map of a Graphoid that Satisfies Weak Transitivity
Jose M. Pea and Roland Nilsson and Johan Bjrkegren and Jesper Tegnr

Info hash519e15dbeab4f1c9fb79c7699f75db6089c6b6bf
Last mirror activity0:33 ago
Size190.69kB (190,689 bytes)
Added2014-04-28 01:56:08
Views1281
Hits24646
ID1804
Typesingle
Downloaded95 time(s)
Uploaded by gravatar.com icon for user henryzlo
FilenameAn Algorithm for Reading Dependencies from the Minimal Undirected Independence Map of a Graphoid that Satisfies Weak Transitivity.pdf
Mirrors4 complete, 0 downloading = 4 mirror(s) total [Log in to see full list]

10 day statistics (2 downloads)
Average Time 2 hrs, 32 mins, 43 secs
Average Speed 0.02kB/s
Best Time 2 mins, 08 secs
Best Speed 1.49kB/s
Worst Time 5 hrs, 03 mins, 18 secs
Worst Speed 0.01kB/s

Send Feedback