4894 search results - page 299 / 979 » The Guarding Problem - Complexity and Approximation |
181
click to vote
CIKM
2000
Springer
15 years 11 months ago
2000
Springer
With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based techniqu...
155
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
177
click to vote
IOR
2008
15 years 6 months ago
2008
We present a new interactive hybrid approach for solving multicriteria optimization problems where features of approximation methods and interactive approaches are incorporated. W...
191
click to vote
JCM
2008
15 years 6 months ago
2008
An analytical model is developed to solve the power-rate assignment problem for multi-rate CDMA systems and calculate the probability density function (PDF) for the downlink traffi...
197
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...