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,11:46:56 ago
Size1.04MB (1,037,500 bytes)
Added2014-04-28 01:56:16
Views1098
Hits24667
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.000010
DB Connect
   0.001845
Lookup hash in DB
   0.002200
Get torrent details
   0.000460
Get torrent details, finished
   0.001276
Get authors
   0.000002
Select authors
   0.001090
Parse bibtex
   0.000047
Write header
   0.000516
get stars
   0.000280
target tab
   0.000013
Request peers
   0.002215
Write table
   0.000036
geoloc peers
   0.000008
render right panel
   0.000015
render ads
   0.001124
fetch current hosters
   0.000922
Done