980 search results - page 191 / 196 » Decentralized Constraint Satisfaction |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
DCOSS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports taskdependent node selection ...
ISNN
2005
Springer
14 years 1 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...