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 activity11d,17:09:06 ago
Size190.69kB (190,689 bytes)
Added2014-04-28 01:56:08
Views1113
Hits24259
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.000008
DB Connect
   0.000628
Lookup hash in DB
   0.000986
Get torrent details
   0.000784
Get torrent details, finished
   0.000899
Get authors
   0.000005
Select authors
   0.000668
Parse bibtex
   0.000116
Write header
   0.000522
get stars
   0.000552
target tab
   0.000045
Request peers
   0.000614
Write table
   0.000200
geoloc peers
   0.000006
home tab
   0.000570
render right panel
   0.000014
render ads
   0.000054
fetch current hosters
   0.000790
Done