324 search results - page 20 / 65 » Guessing based on length functions |
ECCC
2011
13 years 2 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of th...
ASIACRYPT
2003
Springer
14 years 23 days ago
2003
Springer
We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). ...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
ECIR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Traditional retrieval models assume that query terms are independent and rank documents primarily based on various term weighting strategies including TF-IDF and document...