727 search results - page 23 / 146 » Private approximation of search problems |
IRREGULAR
1995
Springer
14 years 2 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
APPROX
2009
Springer
14 years 5 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
TC
2008
13 years 10 months ago
2008
In this paper, the problem of finding good wordlength combinations for fixed-point digital signal processing flowgraphs is addressed. By formulating and solving an approximate opti...
DELOS
2000
14 years 8 days ago
2000
We present the Private Digital Library (PDL) project that represents a service of the Corporate Digital Library (CDL) prototype. The main ideas underlying this project are the foll...
STOC
2006
ACM
14 years 11 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...