Sciweavers

564 search results - page 44 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
13 years 12 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 6 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
AMR
2007
Springer
154views Multimedia» more  AMR 2007»
14 years 2 months ago
Comparison of Dimension Reduction Methods for Database-Adaptive 3D Model Retrieval
Distance measures, along with shape features, are the most critical components in a shape-based 3D model retrieval system. Given a shape feature, an optimal distance measure will v...
Ryutarou Ohbuchi, Jun Kobayashi, Akihiro Yamamoto,...
PRL
2010
205views more  PRL 2010»
13 years 2 months ago
Mining outliers with faster cutoff update and space utilization
It is desirable to find unusual data objects by Ramaswamy et al's distance-based outlier definition because only a metric distance function between two objects is required. It...
Chi-Cheong Szeto, Edward Hung
PPSC
1997
13 years 9 months ago
The Future Fast Fourier Transform?
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
Alan Edelman, Peter McCorquodale, Sivan Toledo