274 search results - page 48 / 55 » Approximating Edit Distance Efficiently |
198
Voted
POPL
2006
ACM
16 years 23 days ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
204
Voted
GIS
2005
ACM
16 years 1 months ago
2005
ACM
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
106
Voted
JGTOOLS
2006
15 years 12 days ago
2006
We render tree foliage levels of detail (LODs) using a new adaptation of billboard clouds. Our contributions are a simple and efficient billboard cloud creation algorithm designed...
121
click to vote
PAMI
2006
15 years 11 days 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...
112
Voted
TKDE
2008
15 years 10 days ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...