1091 search results - page 52 / 219 » Approximation Algorithms for Data Placement Problems |
152
click to vote
CPM
1999
Springer
15 years 10 months ago
1999
Springer
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
172
click to vote
SODA
2007
ACM
15 years 7 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
156
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
174
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
149
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...