( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Combining Elimination Rules in Tree-Based Nearest Neighbor Search Algorithms.

, , , , и . SSPR/SPR, том 6218 из Lecture Notes in Computer Science, стр. 80-89. Springer, (2010)

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.

Luisa Mico-Giner

Xavier Àlvarez Micó

Dominique Micollet

William Micol

Florence Micol

 

Другие публикации лиц с тем же именем

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