Sciweavers

2725 search results - page 137 / 545
» Constraint Solving for Interpolation
Sort
View
SODA
2001
ACM
93views Algorithms» more  SODA 2001»
15 years 5 months ago
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
David Eppstein
AAAI
1990
15 years 5 months ago
Tree Decomposition with Applications to Constraint Processing
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
Itay Meiri, Judea Pearl, Rina Dechter
137
Voted
TIP
2008
109views more  TIP 2008»
15 years 4 months ago
Iterative Rate-Distortion Optimization of H.264 With Constant Bit Rate Constraint
In this paper, we apply the primal-dual decomposition and subgradient projection methods to solve the rate-distortion optimization problem with the constant bit rate constraint. Th...
Cheolhong An, Truong Q. Nguyen
ICMLA
2010
15 years 2 months ago
Classification Models with Global Constraints for Ordinal Data
Ordinal classification is a form of multi-class classification where there is an inherent ordering between the classes, but not a meaningful numeric difference between them. Althou...
Jaime S. Cardoso, Ricardo Sousa
ICTAI
2010
IEEE
15 years 2 months ago
Continuous Search in Constraint Programming
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
Alejandro Arbelaez, Youssef Hamadi, Michèle...