13336 search results - page 445 / 2668 » Computer Vision: Algorithms and Applications |
191
Voted
ALGORITHMICA
2005
15 years 6 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
208
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
185
click to vote
ISSAC
2004
Springer
16 years 8 days ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
172
click to vote
APGV
2009
ACM
16 years 1 months ago
2009
ACM
An inadequately designed display viewed in the dark can easily cause dazzling glare and affect our night vision. In this paper we test a display design in which the spectral light...
183
click to vote
VIS
2004
IEEE
16 years 8 months ago
2004
IEEE
A new method for the simplification and the visualization of vector fields is presented based on the notion of Centroidal Voronoi tessellations (CVT's). A CVT is a special Vo...