Sciweavers

59 search results - page 4 / 12
» The Many Facets of Approximate Similarity Search
Sort
View
SSDBM
2000
IEEE
128views Database» more  SSDBM 2000»
15 years 1 months ago
Supporting Content-Based Searches on Time Series via Approximation
Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series ...
Changzhou Wang, Xiaoyang Sean Wang
109
Voted
TOG
2012
253views Communications» more  TOG 2012»
12 years 12 months ago
Exploring collections of 3D models using fuzzy correspondences
Large collections of 3D models from the same object class (e.g., chairs, cars, animals) are now commonly available via many public repositories, but exploring the range of shape v...
Vladimir G. Kim, Wilmot Li, Niloy J. Mitra, Stephe...
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
15 years 9 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
81
Voted
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
15 years 3 months ago
The Quality vs. Time Trade-off for Approximate Image Descriptor Search
In recent years, content-based image retrieval has become more and more important in many application areas. Similarity retrieval is inherently a very demanding process, in partic...
Rut Siguroardottir, Björn Þór J&...
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
12 years 12 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...