Sciweavers

858 search results - page 167 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
ICASSP
2008
IEEE
15 years 8 months ago
Learning to satisfy
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...
Frederic Thouin, Mark Coates, Brian Eriksson, Robe...
FOCS
2007
IEEE
15 years 8 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
DCOSS
2007
Springer
15 years 8 months ago
Distributed Coalition Formation in Visual Sensor Networks: A Virtual Vision Approach
Abstract. We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports taskdependent node selection ...
Faisal Qureshi, Demetri Terzopoulos
117
Voted
ISNN
2005
Springer
15 years 7 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
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...
Lei Xu
WG
2005
Springer
15 years 7 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...