1397 search results - page 28 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
166
Voted
PAMI
2010
14 years 10 months ago
2010
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithms...
121
Voted
SAC
2008
ACM
15 years 3 months ago
2008
ACM
The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algori...
130
Voted
NETWORKS
2010
15 years 2 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
234
Voted
AUSSOIS
2001
Springer
15 years 8 months ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
121
Voted
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...