CORR
2011
Springer
13 years 7 months ago
2011
Springer
CORR
2011
Springer
13 years 7 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
CORR
2011
Springer
13 years 7 months ago
2011
Springer
—Recent work for single-relay channels shows that quantize-forward (QF) with long-message encoding achieves the same reliable rates as compress-forward (CF) with short-message en...
CORR
2011
Springer
13 years 7 months ago
2011
Springer
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
CORR
2011
Springer
13 years 7 months ago
2011
Springer
—We propose a dynamic spectrum access scheme where secondary users recommend “good” channels to each other and access accordingly. We formulate the problem as an average rewa...
CORR
2011
Springer
13 years 7 months ago
2011
Springer
CORR
2011
Springer
13 years 7 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
CORR
2011
Springer
13 years 7 months ago
2011
Springer
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
CORR
2011
Springer
13 years 7 months ago
2011
Springer
—In this paper we establish the log-convexity of the rate region in 802.11 WLANs. This generalises previous results for Aloha networks and has immediate implications for optimisa...
CORR
2011
Springer
13 years 7 months ago
2011
Springer
We provide a necessary and sufficient condition under which a convex set is approachable in a game with partial monitoring, i.e. where players do not observe their opponents’ mo...