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 activity22d,10:20:02 ago
Size1.04MB (1,037,500 bytes)
Added2014-04-28 01:56:16
Views1021
Hits24386
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.000005
DB Connect
   0.000413
Lookup hash in DB
   0.000673
Get torrent details
   0.000663
Get torrent details, finished
   0.000650
Get authors
   0.000004
Select authors
   0.000521
Parse bibtex
   0.000112
Write header
   0.000521
get stars
   0.000453
target tab
   0.000015
Request peers
   0.000535
Write table
   0.000176
geoloc peers
   0.000005
home tab
   0.000365
render right panel
   0.000008
render ads
   0.000046
fetch current hosters
   0.000718
Done