Sciweavers

ECCC
2011
183views ECommerce» more  ECCC 2011»
12 years 11 months ago
Extractors and Lower Bounds for Locally Samplable Sources
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
Anindya De, Thomas Watson
CORR
2011
Springer
144views Education» more  CORR 2011»
12 years 11 months ago
On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
Mehdi Molkaraie, Payam Pakzad
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 11 months ago
Lower bound for deterministic semantic-incremental branching programs solving GEN
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
Dustin Wehr
CORR
2011
Springer
200views Education» more  CORR 2011»
12 years 11 months ago
Beating the Gilbert-Varshamov Bound for Online Channels
In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1, . . . , xn) ∈ {0, 1}n bit by bit via a channel lim...
Ishay Haviv, Michael Langberg
CDC
2010
IEEE
111views Control Systems» more  CDC 2010»
12 years 11 months ago
Multi-robot monitoring in dynamic environments with guaranteed currency of observations
Abstract-- In this paper we consider the problem of monitoring a known set of stationary features (or locations of interest) in an environment. To observe a feature, a robot must v...
Stephen L. Smith, Daniela Rus
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 1 months ago
Lower Bounds for the Smoothed Number of Pareto optimal Solutions
In 2009, R
Tobias Brunsch, Heiko Roeglin
GLOBECOM
2010
IEEE
13 years 1 months ago
Design of Amplify and Forward MIMO Relay Networks with QoS Constraint
In this paper, we design the optimal precoding matrices for amplify-and-forward (AF) multiple-input multipleoutput (MIMO) relay networks. Specifically, we consider a dualhop relay ...
Jafar Mohammadi, Feifei Gao, Yue Rong
GLOBECOM
2010
IEEE
13 years 1 months ago
Multicast Advance Reservation RWA Heuristics in Wavelength-Routed Networks
In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Advance reservation connection requests specify ...
Neal Charbonneau, Vinod Vokkarane
ECCC
2010
108views more  ECCC 2010»
13 years 1 months ago
Improved bounds for the randomized decision tree complexity of recursive majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Frédéric Magniez, Ashwin Nayak, Mikl...
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 1 months ago
Error Exponent for Multiple-Access Channels:Lower Bounds
A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryles...
Ali Nazari, Achilleas Anastasopoulos, S. Sandeep P...