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 activity75d,04:12:57 ago
Size190.69kB (190,689 bytes)
Added2014-04-28 01:56:08
Views1113
Hits24260
ID1804
Typesingle
Downloaded88 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
Mirrors0 complete, 0 downloading = 0 mirror(s) total [Log in to see full list]


Send Feedback Start
   0.000005
DB Connect
   0.000444
Lookup hash in DB
   0.000858
Get torrent details
   0.000672
Get torrent details, finished
   0.000667
Get authors
   0.000005
Select authors
   0.000528
Parse bibtex
   0.000107
Write header
   0.000629
get stars
   0.000460
target tab
   0.000015
Request peers
   0.000529
Write table
   0.000138
geoloc peers
   0.000004
home tab
   0.000456
render right panel
   0.000040
render ads
   0.000045
fetch current hosters
   0.000988
Done