Sciweavers

564 search results - page 10 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
APPML
2010
112views more  APPML 2010»
15 years 1 months ago
Computing Fourier transforms and convolutions of Sn-1-invariant signals on Sn in time linear in n
Let Sn denote the symmetric group on {1, . . . , n} and Sn-1 the stabilizer subgroup of n. We derive algorithms for computing Fourier transforms of left and right Sn-1-invariant s...
Michael Clausen, Ramakrishna Kakarala
ICIAP
2007
ACM
16 years 1 months ago
A High Performance Exact Histogram Specification Algorithm
Real-time histogram specification methods aims to find a continuous function that transforms a source image to match a target distribution with the highest possible degree of accu...
Alessandro Bevilacqua, Pietro Azzari
SPIEVIP
2010
15 years 3 months ago
Unconstrained license plate detection using the Hausdorff distance
This paper reports on a new technique for unconstrained license plate detection in a surveillance context. The proposed algorithm quickly finds license plates by performing the fo...
Marc Lalonde, Samuel Foucher, Langis Gagnon
SWAT
1994
Springer
130views Algorithms» more  SWAT 1994»
15 years 5 months ago
Dominating Cliques in Distance-Hereditary Graphs
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
Feodor F. Dragan
RECOMB
2007
Springer
16 years 1 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader