168 search results - page 23 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
MIDDLEWARE
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. This paper describes an event dissemination algorithm that impletopic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is...
OPODIS
2004
15 years 1 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
108
click to vote
MP
2007
14 years 11 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
STOC
2004
ACM
16 years 6 hour ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...