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 activity92d,02:21:20 ago
Size1.04MB (1,037,500 bytes)
Added2014-04-28 01:56:16
Views1098
Hits24666
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]



Send Feedback Start
   0.000011
DB Connect
   0.001317
Lookup hash in DB
   0.001233
Get torrent details
   0.000369
Get torrent details, finished
   0.000838
Get authors
   0.000002
Select authors
   0.000515
Parse bibtex
   0.000056
Write header
   0.000540
get stars
   0.000365
target tab
   0.000011
Request peers
   0.000626
Write table
   0.000029
geoloc peers
   0.000005
render right panel
   0.000011
render ads
   0.001036
fetch current hosters
   0.001103
Done