Sciweavers

CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 7 months ago
Capacity Theorems for the AWGN Multi-Way Relay Channel
Abstract--The L-user additive white Gaussian noise multiway relay channel is considered, where multiple users exchange information through a single relay at a common rate. Existing...
Lawrence Ong, Christopher M. Kellett, Sarah J. Joh...
CORR
2010
Springer
47views Education» more  CORR 2010»
13 years 7 months ago
An O(M(n) log n) algorithm for the Jacobi symbol
Richard P. Brent, Paul Zimmermann
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 7 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 7 months ago
Dynamic Policy Programming
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
Mohammad Gheshlaghi Azar, Hilbert J. Kappen
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 7 months ago
An Achievable Rate for the MIMO Individual Channel
We consider the problem of communicating over a multiple-input multiple-output (MIMO) real valued channel for which no mathematical model is specified, and achievable rates are giv...
Yuval Lomnitz, Meir Feder
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 7 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 7 months ago
Polymatroids with Network Coding
Abstract--The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have establi...
Te Sun Han
CORR
2010
Springer
48views Education» more  CORR 2010»
13 years 7 months ago
Are there any good digraph width measures?
Robert Ganian, Petr Hlinený, Joachim Kneis,...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 7 months ago
Compromising Tor Anonymity Exploiting P2P Information Leakage
Privacy of users in P2P networks goes far beyond their current usage and is a fundamental requirement to the adoption of P2P protocols for legal usage. In a climate of cold war be...
Pere Manils, Chaabane Abdelberri, Stevens Le-Blond...