Sciweavers

39 search results - page 6 / 8
» Grid Representation for Efficient Similarity Search in Time ...
Sort
View
SIGMOD
2004
ACM
188views Database» more  SIGMOD 2004»
14 years 6 months ago
Online Event-driven Subsequence Matching over Financial Data Streams
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
Huanmei Wu, Betty Salzberg, Donghui Zhang
CIKM
2005
Springer
13 years 11 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
BTW
2009
Springer
240views Database» more  BTW 2009»
13 years 7 months ago
Efficient Adaptive Retrieval and Mining in Large Multimedia Databases
Abstract: Multimedia databases are increasingly common in science, business, entertainment and many other applications. Their size and high dimensionality of features are major cha...
Ira Assent
GIS
2006
ACM
14 years 7 months ago
Efficient position-independent iconic search using an R-theta index
An iconic image database is a collection of symbolic images where each image is a collection of labeled point features called icons. A method is presented to support fast position...
Charles Ben Cranston, Hanan Samet
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
14 years 26 days ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....