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 activity12d,05:13:52 ago
Size1.04MB (1,037,500 bytes)
Added2014-04-28 01:56:16
Views1055
Hits24519
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.000511
Lookup hash in DB
   0.000802
Get torrent details
   0.000726
Get torrent details, finished
   0.000680
Get authors
   0.000006
Select authors
   0.000571
Parse bibtex
   0.000129
Write header
   0.000535
get stars
   0.000407
target tab
   0.000033
Request peers
   0.000626
Write table
   0.000177
geoloc peers
   0.015107
home tab
   0.000978
render right panel
   0.000035
render ads
   0.000081
fetch current hosters
   0.000934
Done