5115 search results - page 152 / 1023 » On Randomized Lanczos Algorithms |
170
click to vote
ITC
2003
IEEE
15 years 11 months ago
2003
IEEE
Functional verification of complex designs largely relies on the use of simulation in conjunction high-level verification languages (HVL) and test-bench automation (TBA) tools. In...
173
click to vote
ECML
2006
Springer
15 years 10 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...
154
click to vote
DC
2007
15 years 6 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...
193
click to vote
FSTTCS
2010
Springer
15 years 4 months 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...
206
click to vote
SODA
2012
ACM
13 years 8 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...