Sciweavers

15 search results - page 2 / 3
» FTW: fast similarity search under the time warping distance
Sort
View
ICDAR
2011
IEEE
12 years 4 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
ICDE
2005
IEEE
185views Database» more  ICDE 2005»
14 years 5 months ago
A Multiresolution Symbolic Representation of Time Series
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
Vasileios Megalooikonomou, Qiang Wang, Guo Li, Chr...
NOMS
2008
IEEE
139views Communications» more  NOMS 2008»
13 years 11 months ago
Fast similarity search in peer-to-peer networks
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
Thomas Bocek, Ela Hunt, David Hausheer, Burkhard S...
CVPR
2008
IEEE
14 years 6 months ago
Fast image search for learned metrics
We introduce a method that enables scalable image search for learned metrics. Given pairwise similarity and dissimilarity constraints between some images, we learn a Mahalanobis d...
Prateek Jain, Brian Kulis, Kristen Grauman
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 1 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat