147 search results - page 19 / 30 » The Number of Independent Sets in a Graph with Small Maximum... |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
CSL
2011
Springer
13 years 2 months ago
2011
Springer
How much can we infer about the pronunciation of a language – past or present – by observing which words its speakers rhyme? This paper explores the connection between pronunc...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
INDOCRYPT
2005
Springer
14 years 28 days ago
2005
Springer
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...