2735 search results - page 149 / 547 » Comparing notions of randomness |
CSL
2003
Springer
14 years 3 months ago
2003
Springer
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called a...
ESA
2003
Springer
14 years 3 months ago
2003
Springer
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
GECCO
2003
Springer
14 years 3 months ago
2003
Springer
Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, givi...
ISW
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We introduce the notion of persistent authenticated dictionaries, that is, dictionaries where the user can make queries of the type “was element e in set S at time t?â€...
ICANN
1997
Springer
14 years 2 months ago
1997
Springer
We present a corner-detection algorithm based on a model for end-stopping cells in the visual cortex. Shortcomings of this model are overcome by a combination over several scales. ...