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:53:38 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.000014
DB Connect
   0.001315
Lookup hash in DB
   0.001429
Get torrent details
   0.000493
Get torrent details, finished
   0.000905
Get authors
   0.000003
Select authors
   0.000606
Parse bibtex
   0.000105
Write header
   0.000658
get stars
   0.000414
target tab
   0.000013
Request peers
   0.000612
Write table
   0.000037
geoloc peers
   0.000009
render right panel
   0.000006
render ads
   0.000993
fetch current hosters
   0.000803
Done