4843 search results - page 153 / 969 » The Shortcut Problem - Complexity and Approximation |
104
click to vote
INFORMATICASI
2007
15 years 3 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...
TSP
2008
15 years 3 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...
125
click to vote
IPCO
2010
15 years 1 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...
166
click to vote
ALGORITHMICA
2011
14 years 10 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...
111
click to vote
SAT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...