Sciweavers

1763 search results - page 41 / 353
» Dependent random choice
Sort
View
ICIP
2006
IEEE
14 years 10 months ago
Laplace Random Vectors, Gaussian Noise, and the Generalized Incomplete Gamma Function
Wavelet domain statistical modeling of images has focused on modeling the peaked heavy-tailed behavior of the marginal distribution and on modeling the dependencies between coeffi...
Ivan W. Selesnick
RANDOM
1998
Springer
14 years 1 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
14 years 2 months ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek
SOFSEM
2010
Springer
14 years 6 months ago
Parallel Randomized Load Balancing: A Lower Bound for a More General Model
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
Guy Even, Moti Medina
ALENEX
2007
105views Algorithms» more  ALENEX 2007»
13 years 10 months ago
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
Martin Kutz, Pascal Schweitzer