1578 search results - page 63 / 316 » Algorithmic randomness of continuous functions |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
STOC
1991
ACM
15 years 1 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
MIR
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we propose a transductive learning method for content-based image retrieval: Multiple Random Walk (MRW). Its basic idea is to construct two generative models by mea...
PKC
2010
Springer
15 years 1 months ago
2010
Springer
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...
PDP
2007
IEEE
15 years 4 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...