315 search results - page 15 / 63 » Eigenvalue bounds for independent sets |
STACS
2010
Springer
15 years 6 months ago
2010
Springer
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...
MOR
2008
14 years 11 months ago
2008
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 -...
129
click to vote
ICDCS
2008
IEEE
15 years 5 months ago
2008
IEEE
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...
HYBRID
2007
Springer
15 years 5 months ago
2007
Springer
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...
BSL
2000
14 years 11 months ago
2000
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...