Sciweavers

315 search results - page 15 / 63
» Eigenvalue bounds for independent sets
Sort
View
STACS
2010
Springer
14 years 4 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
MOR
2008
87views more  MOR 2008»
13 years 9 months ago
On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP
We consider the average cost problem for partially observable Markov decision processes (POMDP) with finite state, observation, and control spaces. We prove that there exists an -...
Huizhen Yu, Dimitri P. Bertsekas
ICDCS
2008
IEEE
14 years 4 months ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
HYBRID
2007
Springer
14 years 4 months ago
Approximation of the Joint Spectral Radius of a Set of Matrices Using Sum of Squares
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach i...
Pablo A. Parrilo, Ali Jadbabaie
BSL
2000
153views more  BSL 2000»
13 years 9 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon