5115 search results - page 416 / 1023 » On Randomized Lanczos Algorithms |
290
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
Many computer vision problems can be formulated in
a Bayesian framework with Markov Random Field (MRF)
or Conditional Random Field (CRF) priors. Usually, the
model assumes that ...
194
click to vote
STOC
2009
ACM
16 years 8 months ago
2009
ACM
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
215
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
193
click to vote
EUROPAR
2009
Springer
16 years 2 months ago
2009
Springer
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
189
click to vote
SSDBM
2007
IEEE
16 years 1 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...