Sciweavers

9659 search results - page 279 / 1932
» Points on Computable Curves
Sort
View
COMGEO
2006
ACM
15 years 6 months ago
Compatible triangulations and point partitions by series-triangular graphs
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
Jeff Danciger, Satyan L. Devadoss, Don Sheehy
ICCV
2001
IEEE
16 years 8 months ago
Indexing Based on Scale Invariant Interest Points
This paper presents a new method for detecting scale invariant interest points. The method is based on two recent results on scale space: 1) Interest points can be adapted to scal...
Krystian Mikolajczyk, Cordelia Schmid
MP
1998
73views more  MP 1998»
15 years 6 months ago
On proving existence of feasible points in equality constrained optimization problems
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
R. Baker Kearfott
FGR
2011
IEEE
176views Biometrics» more  FGR 2011»
14 years 10 months ago
Prop-free pointing detection in dynamic cluttered environments
Abstract—Vision-based prop-free pointing detection is challenging both from an algorithmic and a systems standpoint. From a computer vision perspective, accurately determining wh...
Pyry Matikainen, Padmanabhan Pillai, Lily B. Mumme...
CORR
2006
Springer
146views Education» more  CORR 2006»
15 years 6 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram