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 activity12d,19:49:03 ago
Size1.04MB (1,037,500 bytes)
Added2014-04-28 01:56:16
Views1088
Hits24639
ID1942
Typesingle
Downloaded61 time(s)
Uploaded by gravatar.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]

Report
Send Feedback Start
   0.000013
DB Connect
   0.001326
Lookup hash in DB
   0.005070
Get torrent details
   0.001195
Get torrent details, finished
   0.001529
Get authors
   0.000002
Select authors
   0.000761
Parse bibtex
   0.000089
Write header
   0.001613
get stars
   0.000474
target tab
   0.000013
Request peers
   0.000794
Write table
   0.000032
geoloc peers
   0.000007
render right panel
   0.000007
render ads
   0.001258
fetch current hosters
   0.001132
Done