Sciweavers

2657 search results - page 163 / 532
» On the complexity of hierarchical problem solving
Sort
View
BC
2002
85views more  BC 2002»
15 years 1 months ago
Invariant recognition of feature combinations in the visual system
The operation of a hierarchical competitive network model (VisNet) of invariance learning in the visual system is investigated to determine how this class of architecture can solve...
Martin C. M. Elliffe, Edmund T. Rolls, Simon M. St...
CIT
2006
Springer
15 years 5 months ago
A High Performance ASIC for Cellular Automata (CA) Applications
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by...
Cheryl A. Kincaid, Saraju P. Mohanty, Armin R. Mik...
NIPS
2001
15 years 3 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
ICPR
2008
IEEE
16 years 2 months ago
Training sequential on-line boosting classifier for visual tracking
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
Helmut Grabner, Horst Bischof, Jan Sochman, Jiri M...
ICIP
2003
IEEE
16 years 3 months ago
Efficient frame vector selection based on ordered sets
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
Tom Ryen, Guido M. Schuster, Aggelos K. Katsaggelo...