Sciweavers

101 search results - page 14 / 21
» A lower bound on the number of triangulations of planar poin...
Sort
View
CVPR
2004
IEEE
14 years 9 months ago
Point Matching as a Classification Problem for Fast and Robust Object Pose Estimation
We propose a novel approach to point matching under large viewpoint and illumination changes that is suitable for accurate object pose estimation at a much lower computational cos...
Vincent Lepetit, Julien Pilet, Pascal Fua
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
13 years 4 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...
CCCG
2010
13 years 9 months ago
On the variance of random polygons
A random polygon is the convex hull of uniformly distributed random points in a convex body K R2 . General upper bounds are established for the variance of the area of a random p...
William L. Steiger, Imre Bárány
CCCG
2008
13 years 9 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
CEC
2005
IEEE
14 years 1 months ago
On the complexity of overcoming gaps with isotropic mutations and elitist selection
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Jens Jägersküpper