Sciweavers

3328 search results - page 136 / 666
» On Plateaued Functions and Their Constructions
Sort
View
NIPS
1990
15 years 7 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
BMCBI
2007
227views more  BMCBI 2007»
15 years 6 months ago
Growing functional modules from a seed protein via integration of protein interaction and gene expression data
Background: Nowadays modern biology aims at unravelling the strands of complex biological structures such as the protein-protein interaction (PPI) networks. A key concept in the o...
Ioannis A. Maraziotis, Konstantina Dimitrakopoulou...
MCS
2008
Springer
15 years 6 months ago
On the stability analysis of nonlinear systems using polynomial Lyapunov functions
In the stability study of nonlinear systems, not to found feasible solution for the LMI problem associated with a quadratic Lyapunov function shows that it doesn't exist posi...
Hajer Bouzaouache, Naceur Benhadj Braiek
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
16 years 6 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
HASKELL
2006
ACM
16 years 13 days ago
Strongly typed memory areas programming systems-level data structures in a functional language
Modern functional languages offer several attractive features to support development of reliable and secure software. However, in our efforts to use Haskell for systems programmin...
Iavor S. Diatchki, Mark P. Jones