2479 search results - page 179 / 496 » Random Event Structures |
157
Voted
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
139
Voted
CRYPTO
1990
Springer
15 years 10 months ago
1990
Springer
We study the following two kinds of one-way hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former...
162
click to vote
UAI
2004
15 years 7 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
148
click to vote
SODA
1996
ACM
15 years 7 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
138
click to vote
PAMI
2008
15 years 6 months ago
2008
We address the issue of classifying complex data. We focus on three main sources of complexity, namely, the high dimensionality of the observed data, the dependencies between these...