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 activity19:03:01 ago
Size190.69kB (190,689 bytes)
Added2014-04-28 01:56:08
Views1191
Hits24455
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
Mirrors1 complete, 0 downloading = 1 mirror(s) total [Log in to see full list]

Report
Send Feedback Start
   0.000003
DB Connect
   0.000241
Lookup hash in DB
   0.000657
Get torrent details
   0.000242
Get torrent details, finished
   0.000421
Get authors
   0.000002
Select authors
   0.000260
Parse bibtex
   0.000056
Write header
   0.000325
get stars
   0.000186
target tab
   0.000010
Request peers
   0.000272
Write table
   0.000029
geoloc peers
   0.029960
render right panel
   0.000012
render ads
   0.000034
fetch current hosters
   0.001618
Done