2569 search results - page 54 / 514 » Approximate Objects and Approximate Theories |
JACM
1998
14 years 11 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
211
click to vote
IACR
2011
13 years 11 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
124
click to vote
CVPR
1997
IEEE
16 years 1 months ago
1997
IEEE
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
110
click to vote
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...