Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems (Special Topic on Machine Learning and Optimization)
Tijl De Bie and Nello Cristianini

Info hash1fae6dbfbf47b107eb5aacd990d57c63431ad610
Last mirror activity86d,00:54:14 ago
Size1.04MB (1,037,500 bytes)
Added2014-04-28 01:56:16
Views1021
Hits24388
ID1942
Typesingle
Downloaded56 time(s)
Uploaded bygravatar.com icon for user henryzlo
FilenameFast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems     (Special Topic on Machine Learning and Optimization).pdf
Mirrors0 complete, 0 downloading = 0 mirror(s) total [Log in to see full list]


Send Feedback Start
   0.000006
DB Connect
   0.000489
Lookup hash in DB
   0.000729
Get torrent details
   0.000692
Get torrent details, finished
   0.000635
Get authors
   0.000005
Select authors
   0.000482
Parse bibtex
   0.000116
Write header
   0.000461
get stars
   0.000491
target tab
   0.000048
Request peers
   0.000585
Write table
   0.000161
geoloc peers
   0.000006
home tab
   0.000610
render right panel
   0.000014
render ads
   0.000052
fetch current hosters
   0.000830
Done