( en | de | ru )

 

Disambiguation of "Imamura, Yasunobu"

Author of the publication

copydeleteadd this publication to your clipboard
High Dimensional Similarity Search with Bundled Query Processing on Hilbert R-Tree.

, , , , , , , and . ICPRAM (1), page 354-359. SciTePress, (2015)

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.

Takeshi Imamura

Takeshi Imamura

 

Other publications of authors with the same name

High Dimensional Similarity Search with Bundled Query Processing on Hilbert R-Tree., , , , , , , and . ICPRAM (1), page 354-359. SciTePress, (2015)Pivot Selection for Dimension Reduction using Annealing by Increasing Resampling., , , , and . LWDA, volume 1917 of CEUR Workshop Proceedings, page 15. CEUR-WS.org, (2017)Annealing by Increasing Resampling., , , , and . ICPRAM (Revised Selected Papers), volume 11996 of Lecture Notes in Computer Science, page 71-92. Springer, (2019)Fast Filtering for Similarity Search Using Conjunctive Enumeration of Sketches in Order of Hamming Distance., , , , , and . ICPRAM, page 499-510. SCITEPRESS, (2024)Nearest-neighbor Search from Large Datasets using Narrow Sketches., , , , , and . ICPRAM, page 401-410. SCITEPRESS, (2022)Pivot Selection for Narrow Sketches by Optimization Algorithms., , , , , and . SISAP, volume 12440 of Lecture Notes in Computer Science, page 33-46. Springer, (2020)Fast Nearest Neighbor Search with Narrow 16-bit Sketch., , , , and . ICPRAM, page 540-547. SciTePress, (2019)Fast Filtering for Nearest Neighbor Search by Sketch Enumeration Without Using Matching., , , , and . Australasian Conference on Artificial Intelligence, volume 11919 of Lecture Notes in Computer Science, page 240-252. Springer, (2019)Annealing by Increasing Resampling in the Unified View of Simulated Annealing., , , , and . ICPRAM, page 173-180. SciTePress, (2019)Fast Hilbert Sort Algorithm Without Using Hilbert Indices., , , and . SISAP, volume 9939 of Lecture Notes in Computer Science, page 259-267. (2016)