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 activity22d,12:35:05 ago
Size190.69kB (190,689 bytes)
Added2014-04-28 01:56:08
Views1175
Hits24391
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.000007
DB Connect
   0.001725
Lookup hash in DB
   0.000892
Get torrent details
   0.001320
Get torrent details, finished
   0.001629
Get authors
   0.000007
Select authors
   0.001521
Parse bibtex
   0.000154
Write header
   0.000933
get stars
   0.000572
target tab
   0.000069
Request peers
   0.000821
Write table
   0.000223
geoloc peers
   0.035080
home tab
   0.000718
render right panel
   0.000017
render ads
   0.000070
fetch current hosters
   0.001051
Done