Sciweavers

564 search results - page 52 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
14 years 24 days ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
COMPGEOM
2006
ACM
14 years 3 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
CAIP
2009
Springer
246views Image Analysis» more  CAIP 2009»
14 years 3 months ago
Human Age Estimation by Metric Learning for Regression Problems
Abstract. The estimation of human age from face images is an interesting problem in computer vision. We proposed a general distance metric learning scheme for regression problems, ...
Yangjing Long
STACS
2010
Springer
14 years 4 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...
PR
2007
100views more  PR 2007»
13 years 8 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz