Sciweavers

2280 search results - page 136 / 456
» Global Optimization for Optimal Generalized Procrustes Analy...
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
IEEEPACT
2003
IEEE
16 years 1 days ago
Compilation, Architectural Support, and Evaluation of SIMD Graphics Pipeline Programs on a General-Purpose CPU
Graphics and media processing is quickly emerging to become one of the key computing workloads. Programmable graphics processors give designers extra flexibility by running a sma...
Mauricio Breternitz Jr., Herbert H. J. Hum, Sanjee...
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
16 years 1 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák
MMM
2009
Springer
112views Multimedia» more  MMM 2009»
16 years 3 months ago
General Highlight Detection in Sport Videos
Abstract. Attention is a psychological measurement of human reflection against stimulus. We propose a general framework of highlight detection by comparing attention intensity dur...
Reede Ren, Joemon M. Jose
CIKM
2009
Springer
16 years 1 months ago
A general magnitude-preserving boosting algorithm for search ranking
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...