380 search results - page 35 / 76 » Cluster Graphs as Abstractions for Constraint Satisfaction P... |
149
click to vote
IBPRIA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper presents a new approach to the problem of simultaneous location and segmentation of object in images. The main emphasis is done on the information provided by ...
147
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
137
click to vote
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
121
click to vote
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
165
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...