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 activity6d,18:23:28 ago
Size190.69kB (190,689 bytes)
Added2014-04-28 01:56:08
Views1181
Hits24427
ID1804
Typesingle
Downloaded90 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
Mirrors1 complete, 0 downloading = 1 mirror(s) total [Log in to see full list]


Send Feedback Start
   0.000003
DB Connect
   0.000419
Lookup hash in DB
   0.000707
Get torrent details
   0.000741
Get torrent details, finished
   0.000595
Get authors
   0.000002
Select authors
   0.000487
Parse bibtex
   0.000080
Write header
   0.000528
get stars
   0.000396
target tab
   0.000009
Request peers
   0.000667
Write table
   0.000028
geoloc peers
   0.023742
render right panel
   0.000015
render ads
   0.000040
fetch current hosters
   0.001077
Done