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 activity85d,21:48:52 ago
Size1.04MB (1,037,500 bytes)
Added2014-04-28 01:56:16
Views1021
Hits24388
ID1942
Typesingle
Downloaded56 time(s)
Uploaded bygravatar.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.000004
DB Connect
   0.000473
Lookup hash in DB
   0.000771
Get torrent details
   0.000743
Get torrent details, finished
   0.000568
Get authors
   0.000005
Select authors
   0.000399
Parse bibtex
   0.000091
Write header
   0.000361
get stars
   0.000429
target tab
   0.000014
Request peers
   0.000635
Write table
   0.000223
geoloc peers
   0.000004
home tab
   0.000541
render right panel
   0.000013
render ads
   0.000048
fetch current hosters
   0.000786
Done