3475 search results - page 128 / 695 » Backbones in Optimization and Approximation |
176
click to vote
EMMCVPR
2011
Springer
14 years 6 months ago
2011
Springer
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
306
click to vote
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...
201
click to vote
ISBI
2004
IEEE
16 years 7 months ago
2004
IEEE
We present a new fast implementation of a non-rigid registration algorithm, based on a finite element elastic deformation model using the mutual information metric with a linear e...
180
click to vote
SARA
2009
Springer
16 years 27 days ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
175
click to vote
ADHOCNOW
2008
Springer
16 years 21 days ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...