4894 search results - page 160 / 979 » The Guarding Problem - Complexity and Approximation |
139
click to vote
JGAA
2006
15 years 6 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...
145
click to vote
INFORMATICASI
2007
15 years 6 months ago
2007
In this paper we deal with the problem of addition of new documents in collection when documents are represented in lower dimensional space by concept indexing. Concept indexing i...
135
click to vote
TSP
2008
15 years 6 months ago
2008
Abstract--We present a versatile framework for tractable computation of approximate variances in large-scale Gaussian Markov random field estimation problems. In addition to its ef...
168
click to vote
IPCO
2010
15 years 4 months ago
2010
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
208
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...