Sciweavers

564 search results - page 6 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
78
Voted
SODA
2004
ACM
131views Algorithms» more  SODA 2004»
14 years 11 months ago
Compression boosting in optimal linear time using the Burrows-Wheeler Transform
Paolo Ferragina, Giovanni Manzini
CVPR
2010
IEEE
14 years 9 months ago
Fast directional chamfer matching
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
Ming-Yu Liu, Oncel Tuzel, Ashok Veeraraghavan, Ram...
MFCS
2007
Springer
15 years 3 months ago
Exact Algorithms for L (2, 1)-Labeling of Graphs
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
Jan Kratochvíl, Dieter Kratsch, Mathieu Lie...
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
15 years 3 months ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh
WSCG
2004
169views more  WSCG 2004»
14 years 11 months ago
Distance Field Compression
This paper compares various techniques for compressing floating point distance fields. Both lossless and lossy techniques are compared against a new lossless technique. The new Ve...
Mark W. Jones