33 search results - page 2 / 7 » Compositions of Random Functions on a Finite Set |
PODS
2004
ACM
14 years 5 months ago
2004
ACM
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
ICCV
2007
IEEE
14 years 6 months ago
2007
IEEE
Particle filters encode a time-evolving probability density by maintaining a random sample from it. Level sets represent closed curves as zero crossings of functions of two variab...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds t...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
WSC
2004
13 years 6 months ago
2004
We consider the problem of estimating the small probability that a function of a finite number of random variables exceeds a large threshold. Each input random variable may be lig...