5115 search results - page 436 / 1023 » On Randomized Lanczos Algorithms |
190
click to vote
APPROX
2004
Springer
16 years 1 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
212
click to vote
SC
2003
ACM
16 years 25 days ago
2003
ACM
We develop and evaluate a system for load management in shared-disk file systems built on clusters of heterogeneous computers. The system generalizes load balancing and server pr...
185
click to vote
STOC
1999
ACM
15 years 12 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
202
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
236
click to vote
ICVGIP
2008
15 years 9 months ago
2008
As vision algorithms mature with increasing inspiration from the learning community, statistically independent pseudo random number generation (PRNG) becomes increasingly importan...