Sciweavers

1261 search results - page 39 / 253
» Approximation algorithms for aligning points
Sort
View
CCCG
2003
14 years 11 months ago
Computing the Closest Point to a Circle
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao
CVPR
2008
IEEE
15 years 11 months ago
3D model matching with Viewpoint-Invariant Patches (VIP)
The robust alignment of images and scenes seen from widely different viewpoints is an important challenge for camera and scene reconstruction. This paper introduces a novel class ...
Changchang Wu, Brian Clipp, Xiaowei Li, Jan-Michae...
WINE
2007
Springer
161views Economy» more  WINE 2007»
15 years 3 months ago
New Algorithms for Approximate Nash Equilibria in Bimatrix Games
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis
MLDM
2010
Springer
14 years 4 months ago
Fast Algorithms for Constant Approximation k-Means Clustering
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran
93
Voted
ISAAC
2005
Springer
122views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Fast k-Means Algorithms with Constant Approximation
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran