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 activity19:30:06 ago
Size1.04MB (1,037,500 bytes)
Added2014-04-28 01:56:16
Views1076
Hits24614
ID1942
Typesingle
Downloaded61 time(s)
Uploaded by gravatar.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]

Report
Send Feedback Start
   0.000003
DB Connect
   0.000301
Lookup hash in DB
   0.000801
Get torrent details
   0.000331
Get torrent details, finished
   0.000525
Get authors
   0.000002
Select authors
   0.000517
Parse bibtex
   0.000062
Write header
   0.000410
get stars
   0.000206
target tab
   0.000010
Request peers
   0.000346
Write table
   0.000028
geoloc peers
   0.056548
render right panel
   0.000008
render ads
   0.000029
fetch current hosters
   0.000489
Done