5329 search results - page 377 / 1066 » The Weighted Majority Algorithm |
166
Voted
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
159
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
169
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper proposes an efficient algorithm that produces near-optimal discrete bit-loading for a Gaussian interference channel that models a DSL network. It first takes a continuou...
184
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
164
click to vote
ESANN
2004
15 years 8 months ago
2004
This paper presents some interesting results obtained by the algorithm by Bauer, Der and Hermann (BDH) [1] for magnification control in Self-Organizing Maps. Magnification control ...