Sciweavers

2996 search results - page 171 / 600
» Numberings and Randomness
Sort
View
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 7 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
209
Voted
NAA
2004
Springer
178views Mathematics» more  NAA 2004»
15 years 11 months ago
Performance Optimization and Evaluation for Linear Codes
In this paper, we develop a probabilistic model for estimation of the numbers of cache misses during the sparse matrix-vector multiplication (for both general and symmetric matrice...
Pavel Tvrdík, Ivan Simecek
WSC
1997
15 years 7 months ago
Selecting the Best System: A Decision-Theoretic Approach
The problem of selecting the best system from a finite set of alternatives is considered from a Bayesian decision-theoretic perspective. The framework presented is quite general,...
Stephen E. Chick
135
Voted
IM
2007
15 years 5 months ago
Infinite Limits and Adjacency Properties of a Generalized Copying Model
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
Anthony Bonato, Jeannette C. M. Janssen
CC
2007
Springer
123views System Software» more  CC 2007»
15 years 5 months ago
An Improved Analysis of Linear Mergers
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 ...
Zeev Dvir, Amir Shpilka