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 activity45d,08:19:34 ago
Size190.69kB (190,689 bytes)
Added2014-04-28 01:56:08
Views1254
Hits24597
ID1804
Typesingle
Downloaded92 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]


Report
Send Feedback Start
   0.000006
DB Connect
   0.000463
Lookup hash in DB
   0.000405
Get torrent details
   0.000127
Get torrent details, finished
   0.000210
Get authors
   0.000000
Select authors
   0.000166
Parse bibtex
   0.000025
Write header
   0.000201
get stars
   0.000100
target tab
   0.000004
Request peers
   0.000275
Write table
   0.000012
geoloc peers
   0.018705
render right panel
   0.000237
render ads
   0.000623
fetch current hosters
   0.000420
Done