453 search results - page 61 / 91 » Tight bounds for the partial-sums problem |
92
Voted
CORR
2007
Springer
15 years 19 days ago
2007
Springer
The problem of coding for channels with time-varying state is studied. Two different models are considered: one in which the channel state cannot depend on the transmitted signal,...
103
click to vote
GC
2007
Springer
15 years 18 days ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
90
Voted
PE
2002
Springer
15 years 9 days ago
2002
Springer
We consider a FIFO multiplexer fed by flows that are individually constrained by arrival curves, and look for the best possible arrival curve for every output flow. This problem a...
118
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
—Nuclear norm minimization (NNM) has recently gained attention for its use in rank minimization problems. In this paper, we define weak, sectional and strong recovery for NNM to...
104
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...