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 activity22d,13:30:05 ago
Size1.04MB (1,037,500 bytes)
Added2014-04-28 01:56:16
Views1060
Hits24558
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.000518
Lookup hash in DB
   0.000647
Get torrent details
   0.000770
Get torrent details, finished
   0.000653
Get authors
   0.000005
Select authors
   0.000540
Parse bibtex
   0.000131
Write header
   0.000587
get stars
   0.000365
target tab
   0.000036
Request peers
   0.000600
Write table
   0.000160
geoloc peers
   0.016436
home tab
   0.001044
render right panel
   0.000082
render ads
   0.000167
fetch current hosters
   0.000917
Done