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 activity45d,10:08:11 ago
Size1.04MB (1,037,500 bytes)
Added2014-04-28 01:56:16
Views1159
Hits24793
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
Mirrors3 complete, 0 downloading = 3 mirror(s) total [Log in to see full list]



Send Feedback Start
   0.000007
DB Connect
   0.000450
Lookup hash in DB
   0.000373
Get torrent details
   0.000136
Get torrent details, finished
   0.000213
Get authors
   0.000001
Select authors
   0.000187
Parse bibtex
   0.000030
Write header
   0.000325
get stars
   0.000101
target tab
   0.000006
Request peers
   0.000275
Write table
   0.000016
geoloc peers
   0.016206
render right panel
   0.000008
render ads
   0.000753
fetch current hosters
   0.000376
Done