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


Report
Send Feedback Start
   0.000007
DB Connect
   0.000471
Lookup hash in DB
   0.000387
Get torrent details
   0.000123
Get torrent details, finished
   0.000221
Get authors
   0.000001
Select authors
   0.000170
Parse bibtex
   0.000030
Write header
   0.000204
get stars
   0.000095
home tab
   0.000094
render right panel
   0.000005
render ads
   0.000395
fetch current hosters
   0.000382
Done