Sciweavers

1319 search results - page 87 / 264
» Recursive Random Fields
Sort
View
158
Voted

Book
270views
16 years 8 months ago
A Field Guide To Genetic Programming
"GP is a systematic, domain-independent method for getting computers to solve problems automatically starting from a high-level statement of what needs to be done. Using ideas...
Riccardo Poli, William B. Langdon, Nicholas Freit...
117
Voted
SETA
2004
Springer
126views Mathematics» more  SETA 2004»
15 years 6 months ago
Algebraic Feedback Shift Registers Based on Function Fields
We study algebraic feedback shift registers (AFSRs) based on quotients of polynomial rings in several variables over a finite field. These registers are natural generalizations o...
Andrew Klapper
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
14 years 3 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
ICML
2004
IEEE
16 years 1 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
ACTA
2008
88views more  ACTA 2008»
14 years 11 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish