Sciweavers

1712 search results - page 101 / 343
» A Computational Approach to Binding Theory
Sort
View
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
15 years 7 months ago
Towards the coevolution of cellular automata controllers for chemical computing with the B-Z reaction
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...
Christopher Stone, Rita Toth, Andrew Adamatzky, Be...
ICCV
2001
IEEE
16 years 3 months ago
Robust Principal Component Analysis for Computer Vision
Principal Component Analysis (PCA) has been widely used for the representation of shape, appearance, and motion. One drawback of typical PCA methods is that they are least squares...
Fernando De la Torre, Michael J. Black
VIS
2007
IEEE
115views Visualization» more  VIS 2007»
16 years 2 months ago
Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications
Abstract--The recently introduced notion of Finite-Time Lyapunov Exponent to characterize Coherent Lagrangian Structures provides a powerful framework for the visualization and ana...
Christoph Garth, Florian Gerhardt, Xavier Tricoc...
ISMB
1993
15 years 3 months ago
Computationally Efficient Cluster Representation in Molecular Sequence Megaclassification
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...
David J. States, Nomi L. Harris, Lawrence Hunter
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
14 years 11 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl