16404 search results - page 168 / 3281 » A set coverage problem |
188
click to vote
EMMCVPR
2005
Springer
15 years 12 months ago
2005
Springer
This paper is devoted to piecewise-constant segmentation of images using a curve evolution approach in a variational formulation. The problem to be solved is also called the minima...
157
click to vote
CVPR
2004
IEEE
15 years 10 months ago
2004
IEEE
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...
161
click to vote
ILP
2000
Springer
15 years 10 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
159
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
152
click to vote
TCS
2008
15 years 6 months ago
2008
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...