Sciweavers

388 search results - page 51 / 78
» Convergence Properties of the K-Means Algorithms
Sort
View
WINET
2002
124views more  WINET 2002»
15 years 1 months ago
CDMA Uplink Power Control as a Noncooperative Game
We present a game-theoretic treatment of distributed power control in CDMA wireless systems. We make use of the conceptual framework of noncooperative game theory to obtain a distr...
Tansu Alpcan, Tamer Basar, R. Srikant, Eitan Altma...
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
15 years 6 months ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...
ECCV
1996
Springer
16 years 3 months ago
Imposing Hard Constraints on Soft Snakes
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snake-like mod...
Pascal Fua, Christian Brechbühler
JAIR
2008
135views more  JAIR 2008»
15 years 1 months ago
On Similarities between Inference in Game Theory and Machine Learning
In this paper, we elucidate the equivalence between inference in game theory and machine learning. Our aim in so doing is to establish an equivalent vocabulary between the two dom...
Iead Rezek, David S. Leslie, Steven Reece, Stephen...
ICML
2004
IEEE
16 years 2 months ago
Leveraging the margin more carefully
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
Nir Krause, Yoram Singer