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 activity2d,13:02:24 ago
Size1.04MB (1,037,500 bytes)
Added2014-04-28 01:56:16
Views1060
Hits24557
ID1942
Typesingle
Downloaded60 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
Mirrors1 complete, 0 downloading = 1 mirror(s) total [Log in to see full list]


Send Feedback Start
   0.000005
DB Connect
   0.000355
Lookup hash in DB
   0.000670
Get torrent details
   0.000706
Get torrent details, finished
   0.000693
Get authors
   0.000005
Select authors
   0.000549
Parse bibtex
   0.000148
Write header
   0.000516
get stars
   0.000466
target tab
   0.000014
Request peers
   0.000638
Write table
   0.000190
geoloc peers
   0.017453
home tab
   0.000921
render right panel
   0.000013
render ads
   0.000059
fetch current hosters
   0.000866
Done