274 search results - page 39 / 55 » Approximating Edit Distance Efficiently |
140
Voted
CCCG
2010
15 years 4 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
104
Voted
ECCV
2002
Springer
16 years 4 months ago
2002
Springer
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
146
Voted
COMPGEOM
2000
ACM
15 years 7 months ago
2000
ACM
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
111
Voted
CW
2002
IEEE
15 years 7 months ago
2002
IEEE
Developing intuitive and efficient methods for shape editing is one of the most important areas in computer graphics, and free-form deformation (FFD), which is one of such methods...
127
Voted
MST
2006
15 years 2 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...