Sciweavers

2354 search results - page 57 / 471
» Randomness, Stochasticity and Approximations
Sort
View
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
13 years 9 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
DAGM
2010
Springer
13 years 9 months ago
Random Fourier Approximations for Skewed Multiplicative Histogram Kernels
Abstract. Approximations based on random Fourier features have recently emerged as an efficient and elegant methodology for designing large-scale kernel machines [4]. By expressing...
Fuxin Li, Catalin Ionescu, Cristian Sminchisescu
STOC
1989
ACM
99views Algorithms» more  STOC 1989»
13 years 12 months ago
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Martin E. Dyer, Alan M. Frieze, Ravi Kannan
RSA
1998
49views more  RSA 1998»
13 years 7 months ago
Normal approximations of the number of records in geometrically distributed random variables
We establish the asymptotic normality of the number of upper records in a sequence of iid geometric random variables. Large deviations and local limit theorems as well as approxim...
Zhi-Dong Bai, Hsien-Kuei Hwang, Wen-Qi Liang
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 7 months ago
Combinatorial Approximation Algorithms for MaxCut using Random Walks
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
Satyen Kale, C. Seshadhri