1632 search results - page 211 / 327 » Sublinear Time Algorithms for Metric Space Problems |
133
click to vote
SI3D
1999
ACM
15 years 8 months ago
1999
ACM
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
111
click to vote
ICMCS
2006
IEEE
15 years 10 months ago
2006
IEEE
Given a time horizon parameter h and an object set O, predictive collision detection finds all the object pairs < oi, oj, ti > which will collide in the future time interva...
150
click to vote
PAMI
2006
15 years 4 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
131
click to vote
DASFAA
2004
IEEE
15 years 7 months ago
2004
IEEE
Users of database applications, especially in the e-commerce domain, often resort to exploratory "trial-and-error" queries since the underlying data space is huge and unf...
130
Voted
EDBT
2006
ACM
16 years 4 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...