Sciweavers

1689 search results - page 62 / 338
» Proximate point searching
Sort
View
TAPIA
2003
ACM
14 years 4 months ago
A new infeasible interior-point algorithm for linear programming
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
Miguel Argáez, Leticia Velázquez
COMPGEOM
1997
ACM
14 years 3 months ago
Approximate Nearest Neighbor Queries Revisited
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
Timothy M. Chan
ICRA
1993
IEEE
131views Robotics» more  ICRA 1993»
14 years 2 months ago
Exploration Strategies for Mobile Robots
The problem of programming a robot t o carry out a systematic exploration of its environment using realistic sensors is considered in this paper. The robot is modelled as a single...
Camillo J. Taylor, David J. Kriegman
ISVC
2010
Springer
13 years 8 months ago
Efficient Marker Matching Using Pair-Wise Constraints in Physical Therapy
In this paper, we report a robust, efficient, and automatic method for matching infrared tracked markers for human motion analysis in computer-aided physical therapy applications. ...
Gregory Johnson, Nianhua Xie, Jill Slaboda, Y. Jus...
3DIM
2003
IEEE
14 years 4 months ago
Effective Nearest Neighbor Search for Aligning and Merging Range Images
This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many...
Ryusuke Sagawa, Tomohito Masuda, Katsushi Ikeuchi