Sciweavers

549 search results - page 82 / 110
» Integer-Forcing Linear Receivers
Sort
View
TSP
2010
13 years 3 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
ICALP
2011
Springer
13 years 17 days ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
ALENEX
2010
161views Algorithms» more  ALENEX 2010»
13 years 10 months ago
Route Planning with Flexible Objective Functions
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders
CORR
2006
Springer
92views Education» more  CORR 2006»
13 years 9 months ago
Highly robust error correction by convex programming
This paper discusses a stylized communications problem where one wishes to transmit a real-valued signal x Rn (a block of n pieces of information) to a remote receiver. We ask wh...
Emmanuel J. Candès, Paige A. Randall
CORR
2007
Springer
69views Education» more  CORR 2007»
13 years 9 months ago
Wireless Network Information Flow
— We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if t...
Amir Salman Avestimehr, Suhas N. Diggavi, David N....