3875 search results - page 102 / 775 » Approximation algorithms for the 0-extension problem |
122
click to vote
ICDT
2005
ACM
15 years 10 months ago
2005
ACM
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
136
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
148
click to vote
AAAI
2010
15 years 5 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
108
click to vote
JGAA
2006
15 years 4 months ago
2006
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...
134
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...