1578 search results - page 103 / 316 » Algorithmic randomness of continuous functions |
AAECC
2007
Springer
14 years 10 months ago
2007
Springer
We discuss parametrizations of filter coefficients of scaling functions and compactly supported orthonormal wavelets with several vanishing moments. We introduce the first discr...
COMPGEOM
1997
ACM
15 years 2 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
DIALM
2008
ACM
14 years 11 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
CRYPTO
2005
Springer
15 years 3 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...
ALMOB
2006
14 years 10 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...