1158 search results - page 62 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
146
click to vote
SIGMOD
2008
ACM
15 years 4 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
156
click to vote
COMPGEOM
2000
ACM
15 years 9 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
126
click to vote
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
158
click to vote
IPL
2010
14 years 11 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
139
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...