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 activity22d,15:49:37 ago
Size190.69kB (190,689 bytes)
Added2014-04-28 01:56:08
Views1175
Hits24391
ID1804
Typesingle
Downloaded89 time(s)
Uploaded bygravatar.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.000006
DB Connect
   0.000444
Lookup hash in DB
   0.000663
Get torrent details
   0.000605
Get torrent details, finished
   0.000583
Get authors
   0.000006
Select authors
   0.000409
Parse bibtex
   0.000119
Write header
   0.000492
get stars
   0.000460
target tab
   0.000018
Request peers
   0.000574
Write table
   0.000162
geoloc peers
   0.019036
home tab
   0.000968
render right panel
   0.000015
render ads
   0.000074
fetch current hosters
   0.001488
Done