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 activity10d,00:53:35 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.000484
Lookup hash in DB
   0.001604
Get torrent details
   0.000785
Get torrent details, finished
   0.000886
Get authors
   0.000005
Select authors
   0.000528
Parse bibtex
   0.000117
Write header
   0.001917
get stars
   0.000534
target tab
   0.000013
Request peers
   0.000748
Write table
   0.000185
geoloc peers
   0.015237
home tab
   0.000830
render right panel
   0.000009
render ads
   0.000052
fetch current hosters
   0.001009
Done