Sciweavers

380 search results - page 59 / 76
» Cluster Graphs as Abstractions for Constraint Satisfaction P...
Sort
View
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 9 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
CP
2005
Springer
14 years 2 months ago
Multi-point Constructive Search
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
J. Christopher Beck
ECCV
2006
Springer
14 years 10 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
SETN
2004
Springer
14 years 2 months ago
Construction and Repair: A Hybrid Approach to Search in CSPs
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
Konstantinos Chatzikokolakis, George Boukeas, Pana...
ECAI
2000
Springer
14 years 29 days ago
Activity Recognition from Video Sequences using Declarative Models
Abstract. We propose here a new approach for video sequence interpretation based on declarative models of activities. The aim of the video sequence interpretation is to recognize i...
Nathanaël Rota, Monique Thonnat