4949 search results - page 41 / 990 » Consistency and Set Intersection |
155
Voted
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
123
click to vote
IPMU
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Many geographical applications need to model spatial phenomena with vague or indeterminate boundaries and interiors. A popular paradigm adopted by the GIS community for t...
145
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Sparse coding which encodes the original signal in a sparse signal space, has shown its state-of-the-art performance in the visual codebook generation and feature quantization pro...
144
Voted
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
111
Voted
IJCAI
1997
15 years 5 months ago
1997
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...