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 activity2d,07:48:24 ago
Size190.69kB (190,689 bytes)
Added2014-04-28 01:56:08
Views1175
Hits24389
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.000006
DB Connect
   0.000288
Lookup hash in DB
   0.000546
Get torrent details
   0.000461
Get torrent details, finished
   0.000609
Get authors
   0.000006
Select authors
   0.000394
Parse bibtex
   0.000123
Write header
   0.000478
get stars
   0.000324
target tab
   0.000015
Request peers
   0.000465
Write table
   0.000153
geoloc peers
   0.017113
home tab
   0.000697
render right panel
   0.000014
render ads
   0.000063
fetch current hosters
   0.001123
Done