Author of the publication

Which Fast Nearest Neighbour Search Algorithm to Use?

, , and . IbPRIA, volume 7887 of Lecture Notes in Computer Science, page 567-574. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Comparison of fast nearest neighbour classifiers for handwritten character recognition., and . Pattern Recognit. Lett., 19 (3-4): 351-356 (1998)Comparison of AESA and LAESA search algorithms using string and tree-edit-distances., and . Pattern Recognit. Lett., 24 (9-10): 1417-1426 (2003)A contextual normalised edit distance., and . ICDE Workshops, page 354-361. IEEE Computer Society, (2008)A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index., and . ICPR, page 3911-3914. IEEE Computer Society, (2010)Impact of the Initialization in Tree-Based Fast Similarity Search Techniques., , and . SIMBAD, volume 7005 of Lecture Notes in Computer Science, page 163-176. Springer, (2011)A Fast Approximated k-Median Algorithm., , and . SSPR/SPR, volume 2396 of Lecture Notes in Computer Science, page 725-733. Springer, (2002)Restructuring versus Non Restructuring Insertions in MDF Indexes., , and . ICPRAM (1), page 474-480. SciTePress, (2012)A fast pivot-based indexing algorithm for metric spaces., , and . Pattern Recognit. Lett., 32 (11): 1511-1516 (2011)Adaptively Learning to Recognize Symbols in Handwritten Early Music., , and . PKDD/ECML Workshops (2), volume 1168 of Communications in Computer and Information Science, page 470-477. Springer, (2019)A fast branch & bound nearest neighbour classifier in metric spaces., , and . Pattern Recognit. Lett., 17 (7): 731-739 (1996)