Sciweavers

873 search results - page 67 / 175
» Rates of convergence for Quicksort
Sort
View
GLOBECOM
2009
IEEE
15 years 3 months ago
Exploring Simulated Annealing and Graphical Models for Optimization in Cognitive Wireless Networks
In this paper we discuss the design of optimization algorithms for cognitive wireless networks (CWNs). Maximizing the perceived network performance towards applications by selectin...
Elena Meshkova, Janne Riihijärvi, Andreas Ach...
COLT
2008
Springer
15 years 1 months ago
More Efficient Internal-Regret-Minimizing Algorithms
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
Amy R. Greenwald, Zheng Li, Warren Schudy
CVPR
2006
IEEE
16 years 1 months ago
Probabilistic 3D Polyp Detection in CT Images: The Role of Sample Alignment
Automatic polyp detection is an increasingly important task in medical imaging with virtual colonoscopy [15] being widely used. In this paper, we present a 3D object detection alg...
Zhuowen Tu, Xiang Sean Zhou, Luca Bogoni, Adrian B...
ICML
2007
IEEE
16 years 20 days ago
Approximate maximum margin algorithms with rules controlled by the number of mistakes
We present a family of incremental Perceptron-like algorithms (PLAs) with margin in which both the "effective" learning rate, defined as the ratio of the learning rate t...
Petroula Tsampouka, John Shawe-Taylor
DCC
2010
IEEE
15 years 6 months ago
An MCMC Approach to Lossy Compression of Continuous Sources
Motivated by the Markov chain Monte Carlo (MCMC) relaxation method of Jalali and Weissman, we propose a lossy compression algorithm for continuous amplitude sources that relies on...
Dror Baron, Tsachy Weissman