1689 search results - page 246 / 338 » Proximate point searching |
166
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
130
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
129
Voted
HT
2009
ACM
15 years 10 months ago
2009
ACM
Web pages such as news and shopping sites often use modular layouts. When used effectively this practice allows authors to present clearly large amounts of information in a single...
161
click to vote
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
We present a Dynamic Data Driven Application System (DDDAS) to track 2D shapes across large pose variations by learning non-linear shape manifold as overlapping, piecewise linear s...
135
click to vote
CGO
2006
IEEE
15 years 10 months ago
2006
IEEE
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...