Sciweavers

315 search results - page 11 / 63
» Eigenvalue bounds for independent sets
Sort
View
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
14 years 10 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
COLT
2008
Springer
13 years 11 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
ICALP
2010
Springer
14 years 2 months ago
Testing Non-uniform k-Wise Independent Distributions over Product Spaces
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
Ronitt Rubinfeld, Ning Xie
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 4 months ago
Left invertibility of discrete-time output-quantized systems: the linear case with finite inputs
This paper studies left invertibility of discrete-time linear output-quantized systems. Quantized outputs are generated according to a given partition of the state-space, while inp...
Nevio Dubbini, Benedetto Piccoli, Antonio Bicchi
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao