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,09:29:06 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.000008
DB Connect
   0.000389
Lookup hash in DB
   0.000710
Get torrent details
   0.000565
Get torrent details, finished
   0.000711
Get authors
   0.000006
Select authors
   0.000463
Parse bibtex
   0.000108
Write header
   0.000496
get stars
   0.000524
target tab
   0.000017
Request peers
   0.000559
Write table
   0.000188
geoloc peers
   0.016991
home tab
   0.000706
render right panel
   0.000011
render ads
   0.000058
fetch current hosters
   0.000793
Done