Sciweavers

16430 search results - page 485 / 3286
» On Computable Tree Functions
Sort
View
CSR
2009
Springer
16 years 1 months ago
A Feebly Secure Trapdoor Function
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
Edward A. Hirsch, Sergey I. Nikolenko
FUIN
2006
89views more  FUIN 2006»
15 years 7 months ago
Recursive Analysis Characterized as a Class of Real Recursive Functions
Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive a...
Olivier Bournez, Emmanuel Hainry
CSB
2004
IEEE
173views Bioinformatics» more  CSB 2004»
15 years 10 months ago
Gene Ontology Friendly Biclustering of Expression Profiles
The soundness of clustering in the analysis of gene expression profiles and gene function prediction is based on the hypothesis that genes with similar expression profiles may imp...
Jinze Liu, Wei Wang 0010, Jiong Yang
DIGITEL
2007
IEEE
16 years 1 months ago
A Brief Survey of Distributed Computational Toys
Distributed Computational Toys are physical artifacts that function based on the coordination of more than one computing device. Often, these toys take the form of a microcontroll...
Eric Schweikardt, Mark D. Gross
CEC
2007
IEEE
15 years 11 months ago
Support vector machines for computing action mappings in learning classifier systems
XCS with Computed Action, briefly XCSCA, is a recent extension of XCS to tackle problems involving a large number of discrete actions. In XCSCA the classifier action is computed wi...
Daniele Loiacono, Andrea Marelli, Pier Luca Lanzi