Sciweavers

7129 search results - page 369 / 1426
» Approximation Algorithms for Treewidth
Sort
View
SIAMCOMP
2002
139views more  SIAMCOMP 2002»
15 years 4 months ago
Approximating the Domatic Number
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
Uriel Feige, Magnús M. Halldórsson, ...
CVIU
2008
132views more  CVIU 2008»
15 years 4 months ago
Global parametric image alignment via high-order approximation
The estimation of parametric global motion is one of the cornerstones of computer vision. Such schemes are able to estimate various motion models (translation, rotation, affine, p...
Yosi Keller, Amir Averbuch
CORR
2011
Springer
153views Education» more  CORR 2011»
14 years 12 months ago
Partially Linear Bayesian Estimation with Application to Sparse Approximations
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
Tomer Michaeli, Daniel Sigalov, Yonina C. Eldar
125
Voted
EMO
2003
Springer
109views Optimization» more  EMO 2003»
15 years 10 months ago
A Population and Interval Constraint Propagation Algorithm
We present PICPA, a new algorithm for tackling constrained continuous multi-objective problems. The algorithm combines constraint propagation techniques and evolutionary concepts. ...
Vincent Barichard, Jin-Kao Hao
PSIVT
2009
Springer
139views Multimedia» more  PSIVT 2009»
15 years 9 months ago
Recovery Rate of Clustering Algorithms
This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the a...
Fajie Li, Reinhard Klette