478 search results - page 10 / 96 » Improving probability bounds by optimization over subsets |
TIT
2011
13 years 2 months ago
2011
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
GLOBECOM
2008
IEEE
13 years 7 months ago
2008
IEEE
In this paper we consider a cooperative network that is trying to reach binary consensus over fading channels. We first characterize the impact of fading on network consensus by up...
CDC
2009
IEEE
14 years 7 days ago
2009
IEEE
Abstract— We characterize the stability and achievable performance of networked estimation under correlated packet losses described by the Gilbert-Elliot model. For scalar contin...
ISAAC
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
BMCBI
2008
13 years 7 months ago
2008
Background: Identification of RNA homologs within genomic stretches is difficult when pairwise sequence identity is low or unalignable flanking residues are present. In both cases...