Sciweavers

478 search results - page 26 / 96
» Convexity minimizes pseudo-triangulations
Sort
View
ICML
2008
IEEE
14 years 8 months ago
No-regret learning in convex games
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
Geoffrey J. Gordon, Amy R. Greenwald, Casey Marks
CVPR
2005
IEEE
14 years 10 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
NIPS
2007
13 years 9 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
DAGSTUHL
2000
13 years 9 months ago
Similarity Measure Computation of Convex Polyhedra Revisited
We study the computation of rotation-invariant similarity measures of convex polyhedra, based on Minkowski's theory of mixed volumes. To compute the similarity measure, a (mix...
Jos B. T. M. Roerdink, Henk Bekker
ICASSP
2010
IEEE
13 years 8 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...