Sciweavers

15 search results - page 3 / 3
» Combinatorial properties of a general domination problem wit...
Sort
View
IJCAI
2003
13 years 6 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
IJCV
2006
299views more  IJCV 2006»
13 years 5 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
PPDP
2010
Springer
13 years 3 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
CVPR
2008
IEEE
14 years 7 months ago
Interactive image matting for multiple layers
Image matting deals with finding the probability that each pixel in an image belongs to a user specified `object' or to the remaining `background'. Most existing methods...
Dheeraj Singaraju, René Vidal
TIP
1998
99views more  TIP 1998»
13 years 4 months ago
Nonlinear image estimation using piecewise and local image models
—We introduce a new approach to image estimation based on a flexible constraint framework that encapsulates meaningful structural image assumptions. Piecewise image models (PIM...
Scott T. Acton, Alan C. Bovik