1647 search results - page 174 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
149
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
125
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
151
Voted
AAECC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
140
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
116
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...