CORR
2010
Springer
13 years 11 months ago
2010
Springer
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...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
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...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
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...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
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...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
CORR
2010
Springer
13 years 11 months ago
2010
Springer
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...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We exhibit incentive compatible multi-unit auctions that are not affine maximizers (i.e. are not of the VCG family) and yet approximate the social welfare to within a factor of 1 ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...