Sciweavers

6881 search results - page 214 / 1377
» Motivation
Sort
View
COMBINATORICS
2004
82views more  COMBINATORICS 2004»
15 years 6 months ago
Decomposing Infinite 2-Connected Graphs into 3-Connected Components
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
R. Bruce Richter
CONNECTION
2004
92views more  CONNECTION 2004»
15 years 6 months ago
High capacity associative memories and connection constraints
: High capacity associative neural networks can be built from networks of perceptrons, trained using simple perceptron training. Such networks perform much better than those traine...
Neil Davey, Rod Adams
CORR
2004
Springer
98views Education» more  CORR 2004»
15 years 6 months ago
A feasible algorithm for typing in Elementary Affine Logic
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
Patrick Baillot, Kazushige Terui
BIOINFORMATICS
2000
99views more  BIOINFORMATICS 2000»
15 years 6 months ago
GeneRAGE: a robust algorithm for sequence clustering and domain detection
Motivation: Efficient, accurate and automatic clustering of large protein sequence datasets, such as complete proteomes, into families, according to sequence similarity. Detection...
Anton J. Enright, Christos A. Ouzounis
BIOINFORMATICS
2002
123views more  BIOINFORMATICS 2002»
15 years 6 months ago
Making sense of microarray data distributions
Motivation: Typical analysis of microarray data has focused on spot by spot comparisons within a single organism. Less analysis has been done on the comparison of the entire distr...
David C. Hoyle, Magnus Rattray, Ray Jupp, Andy Bra...