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 activity10d,00:30:41 ago
Size190.69kB (190,689 bytes)
Added2014-04-28 01:56:08
Views1165
Hits24355
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.000458
Lookup hash in DB
   0.001910
Get torrent details
   0.000677
Get torrent details, finished
   0.000670
Get authors
   0.000005
Select authors
   0.000828
Parse bibtex
   0.000117
Write header
   0.000469
get stars
   0.000832
target tab
   0.000018
Request peers
   0.001590
Write table
   0.000152
geoloc peers
   0.017813
home tab
   0.001573
render right panel
   0.000014
render ads
   0.000301
fetch current hosters
   0.001161
Done