489 search results - page 29 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
SIGMOD
1999
ACM
13 years 12 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
IPL
2002
13 years 7 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
TALG
2010
13 years 6 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
CC
2007
Springer
14 years 1 months ago
2007
Springer
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...