Sciweavers

1641 search results - page 102 / 329
» Termination Analysis with Algorithmic Learning
Sort
View
201
Voted
TCS
2008
15 years 3 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
139
Voted
BIBE
2007
IEEE
124views Bioinformatics» more  BIBE 2007»
15 years 10 months ago
Finding Cancer-Related Gene Combinations Using a Molecular Evolutionary Algorithm
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
Chan-Hoon Park, Soo-Jin Kim, Sun Kim, Dong-Yeon Ch...
128
Voted
ICDAR
1999
IEEE
15 years 8 months ago
Cursive Character Detection using Incremental Learning
This paper describes a new hybrid architecture for an artificial neural network classifier that enables incremental learning. The learning algorithm of the proposed architecture d...
Jean-François Hébert, Marc Parizeau,...
97
Voted
ICIP
2010
IEEE
15 years 1 months ago
Learning simple texture discrimination filters
Current texture analysis methods enable good discrimination but are computationally too expensive for applications which require high frame rates. This occurs because they use red...
Rui F. C. Guerreiro, Pedro M. Q. Aguiar
123
Voted
ICML
2003
IEEE
16 years 4 months ago
Optimization with EM and Expectation-Conjugate-Gradient
We show a close relationship between the Expectation - Maximization (EM) algorithm and direct optimization algorithms such as gradientbased methods for parameter learning. We iden...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...