7129 search results - page 388 / 1426 » Approximation Algorithms for Treewidth |
161
Voted
DASFAA
2003
IEEE
15 years 10 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
191
click to vote
ESA
2003
Springer
15 years 10 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
154
click to vote
SIGMOD
1998
ACM
15 years 9 months ago
1998
ACM
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
159
Voted
DOLAP
2005
ACM
15 years 7 months ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
198
click to vote
COMGEO
2002
ACM
15 years 4 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...