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 activity46d,14:41:11 ago
Size190.69kB (190,689 bytes)
Added2014-04-28 01:56:08
Views1197
Hits24495
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
Mirrors0 complete, 0 downloading = 0 mirror(s) total [Log in to see full list]

Report
Send Feedback Start
   0.000010
DB Connect
   0.001129
Lookup hash in DB
   0.001175
Get torrent details
   0.000381
Get torrent details, finished
   0.000760
Get authors
   0.000001
Select authors
   0.000545
Parse bibtex
   0.000063
Write header
   0.000639
get stars
   0.000283
target tab
   0.000010
Request peers
   0.000654
Write table
   0.000028
geoloc peers
   0.000005
render right panel
   0.000011
render ads
   0.001112
fetch current hosters
   0.001209
Done