Sciweavers

329 search results - page 60 / 66
» Fast structural similarity index algorithm
Sort
View
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
14 years 4 months ago
Exact Discovery of Time Series Motifs.
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
Abdullah Mueen, Eamonn J. Keogh, M. Brandon Westov...
ECCV
2002
Springer
14 years 9 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
14 years 1 months ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 9 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
IJON
1998
172views more  IJON 1998»
13 years 7 months ago
Blind separation of convolved mixtures in the frequency domain
In this paper we employ information theoretic algorithms, previously used for separating instantaneous mixtures of sources, for separating convolved mixtures in the frequency doma...
Paris Smaragdis