2354 search results - page 215 / 471 » Randomness, Stochasticity and Approximations |
132
click to vote
APPROX
2006
Springer
15 years 8 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 ...
161
click to vote
JCM
2008
15 years 4 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...
161
Voted
JCSS
2002
15 years 4 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...
147
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
170
click to vote
CORR
2011
Springer
14 years 11 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 ...