1629 search results - page 104 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
CSCLP
2004
Springer
15 years 3 months ago
2004
Springer
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
165
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
ICSAP
2010
15 years 1 months ago
2010
— When sensors are redundantly deployed, a subset of sensors should be selected to actively monitor the field (referred to as a "cover"), while the rest of the sensors ...
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
Image segmentation is a crucial part of image processing applications. Currently available approaches require significant computer power to handle large images. We present an effi...
120
click to vote
CAV
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interp...