1554 search results - page 139 / 311 » Parameterized Complexity and Approximation Algorithms |
157
Voted
SPIRE
2010
Springer
15 years 2 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
140
Voted
SIAMJO
2008
15 years 3 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
130
Voted
CHARME
1997
Springer
15 years 7 months ago
1997
Springer
Formal verification techniques need to deal with the complexity of the systems rified. Most often, this problem is solved by taking an abstract model of the system and aiming at a...
180
Voted
PODS
2011
ACM
14 years 6 months ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
167
Voted
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...