Sciweavers

133 search results - page 3 / 27
» On the distinct distances determined by a planar point set
Sort
View
TASE
2010
IEEE
13 years 2 days ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
CBMS
2003
IEEE
13 years 9 months ago
Planar Arrangement of High-Dimensional Biomedical Data Sets by Isomap Coordinates
This article addresses 2-dimensional layout of high-dimensional biomedical datasets, which is useful for browsing them efficiently. We employ the Isomap technique, which is based ...
Ik Soo Lim, Pablo de Heras Ciechomski, Sofiane Sar...
ICDE
2001
IEEE
180views Database» more  ICDE 2001»
14 years 6 months ago
Distinctiveness-Sensitive Nearest Neighbor Search for Efficient Similarity Retrieval of Multimedia Information
Nearest neighbor (NN) search in high dimensional feature space is widely used for similarity retrieval of multimedia information. However, recent research results in the database ...
Norio Katayama, Shin'ichi Satoh
ICCV
1995
IEEE
13 years 9 months ago
Locating Objects Using the Hausdorff Distance
The Hausdorff distance is a measure defined between two point sets, here representing a model and an image. The Hausdorff distance is reliable even when the image contains multipl...
William Rucklidge
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
13 years 10 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount