5153 search results - page 160 / 1031 » Introduction to Randomized Algorithms |
128
Voted
ECML
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. A combinatorial random variable is a discrete random variable defined over a combinatorial set (e.g., a power set of a given set). In this paper we introduce combinatoria...
108
click to vote
DC
2007
15 years 2 months ago
2007
d bins abstraction and works in two phases. The main novelty of the work is in the first phase where the number of contending processes is reduced in a controlled manner. Probabil...
144
Voted
FSTTCS
2010
Springer
15 years 24 days ago
2010
Springer
For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound an...
151
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
98
Voted
IPL
2008
15 years 2 months ago
2008
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...