1397 search results - page 16 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
MINENET
2005
ACM
14 years 2 months ago
2005
ACM
Increasingly powerful fault management systems are required to ensure robustness and quality of service in today’s networks. In this context, event correlation is of prime impor...
ICIP
2003
IEEE
14 years 10 months ago
2003
IEEE
Robust registration of two 3-D point sets is a common problem in computer vision. The Iterative Closest Point (ICP) algorithm is undoubtedly the most popular algorithm for solving...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...