5115 search results - page 341 / 1023 » On Randomized Lanczos Algorithms |
212
click to vote
JCSS
2002
15 years 7 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
226
click to vote
ICST
2010
IEEE
15 years 5 months ago
2010
IEEE
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
237
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
230
click to vote
CORR
2012
Springer
14 years 3 months ago
2012
Springer
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
185
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...