4377 search results - page 214 / 876 » Mass problems and randomness |
145
click to vote
CSR
2007
Springer
16 years 23 days ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
178
click to vote
ICTAI
2006
IEEE
16 years 19 days ago
2006
IEEE
The discovery of objects with exceptional behavior is an important challenge from a knowledge discovery standpoint and has attracted much attention recently. In this paper, we pre...
204
click to vote
APPROX
2004
Springer
16 years 12 hour ago
2004
Springer
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
161
click to vote
COCO
2003
Springer
15 years 12 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
156
click to vote
CRYPTO
1998
Springer
15 years 10 months ago
1998
Springer
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...