Sciweavers

1175 search results - page 19 / 235
» Search in Multimedia Databases Using Similarity Distance
Sort
View
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
15 years 10 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
85
Voted
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
14 years 7 months ago
CP-index: using clustering and pivots for indexing non-metric spaces
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
Victor Sepulveda, Benjamin Bustos
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 1 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
SPIRE
2005
Springer
15 years 2 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
DEXA
2009
Springer
222views Database» more  DEXA 2009»
15 years 4 months ago
On Index-Free Similarity Search in Metric Spaces
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
Tomás Skopal, Benjamin Bustos