231 search results - page 38 / 47 » The TS-tree: efficient time series search and retrieval |
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Online boosting methods have recently been used successfully for tracking, background subtraction etc. Conventional online boosting algorithms emphasize on interchanging new weak ...
LREC
2008
13 years 9 months ago
2008
Dating of contents is relevant to multiple advanced Natural Language Processing (NLP) applications, such as Information Retrieval or Question Answering. These could be improved by...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
The problem of multimodal data mining in a multimedia database can be addressed as a structured prediction problem where we learn the mapping from an input to the structured and i...
CPM
1998
Springer
13 years 12 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...