725 search results - page 57 / 145 » Bounding Degrees on RPL |
104
click to vote
TIT
2002
15 years 10 days ago
2002
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
95
Voted
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
116
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and in...
101
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
133
click to vote
MST
2011
14 years 7 months ago
2011
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...