Sciweavers

5771 search results - page 810 / 1155
» Learning similarity space
Sort
View
DBA
2006
236views Database» more  DBA 2006»
15 years 9 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
NIPS
1998
15 years 9 months ago
Facial Memory Is Kernel Density Estimation (Almost)
We compare the ability of three exemplar-based memory models, each using three different face stimulus representations, to account for the probability a human subject responded &q...
Matthew N. Dailey, Garrison W. Cottrell, Thomas A....
BMCBI
2008
124views more  BMCBI 2008»
15 years 7 months ago
Alignment of protein structures in the presence of domain motions
Background: Structural alignment is an important step in protein comparison. Well-established methods exist for solving this problem under the assumption that the structures under...
Roberto Mosca, Barbara Brannetti, Thomas R. Schnei...
PAA
2006
15 years 7 months ago
Efficient median based clustering and classification techniques for protein sequences
Abstract In this paper, an efficient K-medians clustering (unsupervised) algorithm for prototype selection and Supervised K-medians (SKM) classification technique for protein seque...
P. A. Vijaya, M. Narasimha Murty, D. K. Subramania...
SIAMCO
2008
108views more  SIAMCO 2008»
15 years 7 months ago
A Viability Theorem for Morphological Inclusions
The aim of this paper is to adapt the Viability Theorem from differential inclusions (governing the evolution of vectors in a finite dimensional space) to so-called morphological i...
Thomas Lorenz