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 activity12d,04:48:11 ago
Size190.69kB (190,689 bytes)
Added2014-04-28 01:56:08
Views1165
Hits24355
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.000005
DB Connect
   0.000378
Lookup hash in DB
   0.000661
Get torrent details
   0.000653
Get torrent details, finished
   0.000638
Get authors
   0.000006
Select authors
   0.000563
Parse bibtex
   0.000122
Write header
   0.000663
get stars
   0.000416
target tab
   0.000016
Request peers
   0.000580
Write table
   0.000194
geoloc peers
   0.016197
home tab
   0.000610
render right panel
   0.000014
render ads
   0.000107
fetch current hosters
   0.000847
Done