Sciweavers

3406 search results - page 62 / 682
» Computational models of classical conditioning
Sort
View
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
14 years 9 days ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 8 months ago
Distributed anonymous discrete function computation
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
Julien M. Hendrickx, Alexander Olshevsky, John N. ...
ESANN
2008
13 years 10 months ago
Computationally Efficient Neural Field Dynamics
We propose a modification of the dynamic neural field model of Amari [1], aiming at reducing the simulation effort by employing spaceand frequency representations of the dynamic st...
Alexander Gepperth, Jannik Fritsch, Christian Goer...
ICDM
2003
IEEE
154views Data Mining» more  ICDM 2003»
14 years 2 months ago
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
In this paper we study the problem of classifying chemical compound datasets. We present a sub-structure-based classification algorithm that decouples the sub-structure discovery...
Mukund Deshpande, Michihiro Kuramochi, George Kary...
ICDIM
2007
IEEE
14 years 3 months ago
Pattern-based decision tree construction
Learning classifiers has been studied extensively the last two decades. Recently, various approaches based on patterns (e.g., association rules) that hold within labeled data hav...
Dominique Gay, Nazha Selmaoui, Jean-Françoi...