4894 search results - page 159 / 979 » The Guarding Problem - Complexity and Approximation |
171
click to vote
TOC
2008
15 years 6 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
154
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
156
click to vote
AIPS
2008
15 years 8 months ago
2008
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
142
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...
177
click to vote
AAAI
2010
15 years 8 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...