Sciweavers

1736 search results - page 23 / 348
» String Extension Learning
Sort
View
EUROGP
2003
Springer
15 years 3 months ago
Evolving Finite State Transducers: Some Initial Explorations
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
Simon M. Lucas
NIPS
2008
14 years 11 months ago
Bayesian Synchronous Grammar Induction
We present a novel method for inducing synchronous context free grammars (SCFGs) from a corpus of parallel string pairs. SCFGs can model equivalence between strings in terms of su...
Phil Blunsom, Trevor Cohn, Miles Osborne
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
14 years 11 months ago
Experiments with indexed FOR-loops in genetic programming
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
Gayan Wijesinghe, Victor Ciesielski
CRYPTO
2006
Springer
89views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Oblivious Transfer and Linear Functions
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
ICNP
2006
IEEE
15 years 4 months ago
High Speed Pattern Matching for Network IDS/IPS
— The phenomenal growth of the Internet in the last decade and society’s increasing dependence on it has brought along, a flood of security attacks on the networking and compu...
Mansoor Alicherry, Muthusrinivasan Muthuprasanna, ...