901 search results - page 1 / 181 » Analyzing linear mergers |
RSA
2008
13 years 4 months ago
2008
Mergers are functions that transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one of the input sources has minentropy rate ...
CC
2007
Springer
13 years 4 months ago
2007
Springer
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
ASPDAC
2007
ACM
13 years 8 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
SODA
2012
ACM
11 years 7 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...
EUROPAR
2008
Springer
13 years 6 months ago
2008
Springer
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...