6315 search results - page 168 / 1263 » Approximating Solution Structure |
218
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
157
click to vote
WADS
2007
Springer
16 years 18 days ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
148
click to vote
SI3D
2006
ACM
16 years 13 days ago
2006
ACM
Natural scenes contain large amounts of geometry, such as hundreds of thousands or even millions of tree leaves and grass blades. Subtle lighting effects present in such environme...
191
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
183
click to vote
CPM
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...