4843 search results - page 152 / 969 » The Shortcut Problem - Complexity and Approximation |
122
click to vote
ICIP
2000
IEEE
16 years 4 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 ...
106
click to vote
AIPS
2008
15 years 5 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...
107
click to vote
ESA
2008
Springer
15 years 5 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...
132
click to vote
AAAI
2010
15 years 4 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 ...
100
click to vote
JGAA
2006
15 years 3 months ago
2006
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...