Sciweavers

142 search results - page 26 / 29
» An Experimental Comparison of Symbolic and Connectionist Lea...
Sort
View
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
14 years 15 days ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
AAAI
1994
13 years 8 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
ICASSP
2011
IEEE
12 years 10 months ago
Real-time conjugate gradients for online fMRI classification
Real-time functional magnetic resonance imaging (rtfMRI) enables classification of brain activity during data collection thus making inference results accessible to both the subj...
Hao Xu, Yongxin Taylor Xi, Ray Lee, Peter J. Ramad...
JCDL
2006
ACM
151views Education» more  JCDL 2006»
14 years 28 days ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber
KELSI
2004
Springer
14 years 10 days ago
Improving Rule Induction Precision for Automated Annotation by Balancing Skewed Data Sets
There is an overwhelming increase in submissions to genomic databases, posing a problem for database maintenance, especially regarding annotation of fields left blank during submi...
Gustavo E. A. P. A. Batista, Maria Carolina Monard...