7930 search results - page 299 / 1586 » Greedy in Approximation Algorithms |
192
click to vote
COCOON
2005
Springer
15 years 8 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...
194
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such high demand storage servers are used as web servers, or multimedia servers...
220
Voted
PCI
2001
Springer
15 years 11 months ago
2001
Springer
We demonstrate that an algorithm proposed by Drineas et. al. in [7] to approximate the singular vectors/values of a matrix A, is not only of theoretical interest but also a fast, v...
214
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
198
click to vote
RECOMB
2000
Springer
15 years 10 months ago
2000
Springer
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...