489 search results - page 49 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
PODS
2003
ACM
14 years 9 months ago
2003
ACM
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
DAM
2010
13 years 9 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...