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,17:49:43 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.000011
DB Connect
   0.000970
Lookup hash in DB
   0.001172
Get torrent details
   0.000416
Get torrent details, finished
   0.000852
Get authors
   0.000002
Select authors
   0.000524
Parse bibtex
   0.000062
Write header
   0.000484
get stars
   0.000358
target tab
   0.000010
Request peers
   0.000529
Write table
   0.000029
geoloc peers
   0.000007
render right panel
   0.000006
render ads
   0.000960
fetch current hosters
   0.000711
Done