Sciweavers

1071 search results - page 184 / 215
» Programming with enumerable sets of structures
Sort
View
IJON
2006
146views more  IJON 2006»
14 years 10 months ago
Feature selection and classification using flexible neural tree
The purpose of this research is to develop effective machine learning or data mining techniques based on flexible neural tree FNT. Based on the pre-defined instruction/operator se...
Yuehui Chen, Ajith Abraham, Bo Yang
ENTCS
2007
100views more  ENTCS 2007»
14 years 10 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
CCE
2005
14 years 10 months ago
Logic-based outer approximation for globally optimal synthesis of process networks
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
María Lorena Bergamini, Pío A. Aguir...
TCBB
2010
98views more  TCBB 2010»
14 years 5 months ago
VARUN: Discovering Extensible Motifs under Saturation Constraints
Abstract-The discovery of motifs in biosequences is frequently torn between the rigidity of the model on the one hand and the abundance of candidates on the other. In particular, m...
Alberto Apostolico, Matteo Comin, Laxmi Parida
ICASSP
2011
IEEE
14 years 2 months ago
Variability regularization in large-margin classification
This paper introduces a novel regularization strategy to address the generalization issues for large-margin classifiers from the Empirical Risk Minimization (ERM) perspective. Fi...
Dwi Sianto Mansjur, Ted S. Wada, Biing-Hwang Juang