564 search results - page 8 / 113 » Linear Time Algorithms for Exact Distance Transform |
SI3D
2006
ACM
14 years 1 months ago
2006
ACM
This paper studies jump flooding as an algorithmic paradigm in the general purpose computation with GPU. As an example application of jump flooding, the paper discusses a constant...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
SPIRE
2009
Springer
14 years 2 months ago
2009
Springer
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...
FOCS
1999
IEEE
14 years 1 days ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
Consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomi...