511 search results - page 30 / 103 » TSP with bounded metrics |
96
Voted
COLT
1997
Springer
15 years 4 months ago
1997
Springer
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...
116
Voted
SLIP
2003
ACM
15 years 5 months ago
2003
ACM
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
129
click to vote
ICALP
2009
Springer
16 years 28 days ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
102
Voted
TSP
2008
15 years 16 days ago
2008
We propose a wireless fading channel prediction algorithm for a pilot-symbol aided Orthogonal Frequency Division Multiplexing (OFDM) system. Assuming a doubly selective (time and ...
114
Voted
TSP
2011
14 years 7 months ago
2011
—This paper studies low-delay Wyner–Ziv coding, i.e., lossy source coding with side information at the decoder, with emphasis on the extreme of zero delay. To achieve zero dela...