453 search results - page 51 / 91 » Tight bounds for the partial-sums problem |
CORR
2007
Springer
15 years 20 days ago
2007
Springer
—The capacity of the two-user Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is du...
75
Voted
TIT
2002
15 years 10 days ago
2002
The problem of placing training symbols optimally for orthogonal frequency-division multiplexing (OFDM) and single-carrier systems is considered. The channel is assumed to be quasi...
116
Voted
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
125
Voted
COCOON
2001
Springer
15 years 5 months ago
2001
Springer
d by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus o...
122
Voted
COCOON
2005
Springer
15 years 2 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...