Matched-field processing speedup through fast nearest-neighbor search in excitation space.
Author(s) -
Pierre Zakarauskas,
John M. Ozard,
Don G. Berryman,
Mike Wilmut
Publication year - 1992
Publication title -
the journal of the acoustical society of america
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.619
H-Index - 187
eISSN - 1520-8524
pISSN - 0001-4966
DOI - 10.1121/1.403412
Subject(s) - nearest neighbor search , k nearest neighbors algorithm , partition (number theory) , replica , fixed radius near neighbors , best bin first , curse of dimensionality , mathematics , algorithm , speedup , nearest neighbor graph , nearest neighbor chain algorithm , computer science , combinatorics , cluster analysis , artificial intelligence , parallel computing , statistics , art , canopy clustering algorithm , correlation clustering , visual arts
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom