315 search results - page 20 / 63 » Eigenvalue bounds for independent sets |
245
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
179
click to vote
EUROCRYPT
2010
Springer
15 years 11 months ago
2010
Springer
We construct the first public-key encryption scheme in the Bounded-Retrieval Model (BRM), providing security against various forms of adversarial “key leakage” attacks. In th...
145
click to vote
NIPS
2007
15 years 7 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
170
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
176
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of...