2354 search results - page 48 / 471 » Randomness, Stochasticity and Approximations |
109
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
144
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
110
click to vote
CGF
1999
15 years 1 months ago
1999
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly i...
131
Voted
ISCI
2010
15 years 10 days ago
2010
A random set can be regarded as the result of the imprecise observation of a random variable. Following this interpretation, we study to which extent the upper and lower probabili...
131
Voted
ICANN
2001
Springer
15 years 6 months ago
2001
Springer
The method of conjugate gradients provides a very effective way to optimize large, deterministic systems by gradient descent. In its standard form, however, it is not amenable to ...