A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements
- 1 January 1994
- journal article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 15 (1), 9-17
- https://doi.org/10.1016/0167-8655(94)90095-7
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- New techniques for best-match retrievalACM Transactions on Information Systems, 1990
- Estimating the intrinsic dimensionality of discrete utterancesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Fast speaker-independent DTW recognition of isolated words using a metric-space search algorithm (AESA)Speech Communication, 1988
- On the use of a metric-space search algorithm (AESA) for fast DTW-based recognition of isolated wordsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1988
- An algorithm for finding nearest neighbours in (approximately) constant average timePattern Recognition Letters, 1986
- A Metric for Comparing Relational DescriptionsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1985
- A distance measure between attributed relational graphs for pattern recognitionIEEE Transactions on Systems, Man, and Cybernetics, 1983
- Isolated and Connected Word Recognition--Theory and Selected ApplicationsIEEE Transactions on Communications, 1981
- An Intrinsic Dimensionality Estimator from Near-Neighbor InformationIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
- A Branch and Bound Algorithm for Computing k-Nearest NeighborsIEEE Transactions on Computers, 1975