


default search action
16th SISAP 2023, A Coruña, Spain
- Oscar Pedreira

, Vladimir Estivill-Castro
:
Similarity Search and Applications - 16th International Conference, SISAP 2023, A Coruña, Spain, October 9-11, 2023, Proceedings. Lecture Notes in Computer Science 14289, Springer 2023, ISBN 978-3-031-46993-0
Research Track
- Cole Foster, Edgar Chávez, Benjamin B. Kimia:

Finding HSP Neighbors via an Exact, Hierarchical Approach. 3-18 - Ryota Tomoda, Hisashi Koga:

Approximate Similarity Search for Time Series Data Enhanced by Section Min-Hash. 19-32 - Edgar Chávez

, Stéphane Marchand-Maillet
, Adolfo J. Quiroz
:
Mutual k-Nearest Neighbor Graph for Data Analysis: Application to Metric Space Clustering. 33-40 - Erik Thordsen

, Erich Schubert
:
An Alternating Optimization Scheme for Binary Sketches for Cosine Similarity Search. 41-55 - Conrado Martínez

, Alfredo Viola
, Jun Wang
:
Unbiased Similarity Estimators Using Samples. 56-63 - Gianluca Moro

, Luca Ragazzi
, Lorenzo Valgimigli
, Lorenzo Molfetta:
Retrieve-and-Rank End-to-End Summarization of Biomedical Studies. 64-78 - Elena Flondor

, Marc Frîncu
:
Fine-Grained Categorization of Mobile Applications Through Semantic Similarity Techniques for Apps Classification. 79-87 - Shoshana Marcus, Dina Sokol

, Sarah Zelikovitz:
Runs of Side-Sharing Tandems in Rectangular Arrays. 88-102 - Edgar Chávez

, Eric Sadit Tellez
:
Turbo Scan: Fast Sequential Nearest Neighbor Search in High Dimensions. 103-110 - Jaroslav Hlavác

, Martin Kopp
, Jan Kohout, Tomás Skopal
:
Class Representatives Selection in Non-metric Spaces for Nearest Prototype Classification. 111-124 - Matheus A. L. Matiazzo, Vitor de Castro-Silva, Rafael Seidi Oyamada

, Daniel S. Kaster:
The Dataset-Similarity-Based Approach to Select Datasets for Evaluation in Similarity Retrieval. 125-132 - Omar Shahbaz Khan

, Martin Aumüller
, Björn Þór Jónsson
:
Suitability of Nearest Neighbour Indexes for Multimedia Relevance Feedback. 133-147 - Andreas Lang

, Erich Schubert
:
Accelerating k-Means Clustering with Cover Trees. 148-162 - Gylfi Þór Guðmundsson

, Björn Þór Jónsson
:
Is Quantized ANN Search Cursed? Case Study of Quantifying Search and Index Quality. 163-170 - Rameshwar Pratap

, Raghav Kulkarni:
Minwise-Independent Permutations with Insertion and Deletion of Features. 171-184 - Félix Iglesias

, Tanja Zseby
, Alexander Hartl
, Arthur Zimek
:
SDOclust: Clustering with Sparse Data Observers. 185-199 - Martin Aumüller

, Matteo Ceccarello
:
Solving k-Closest Pairs in High-Dimensional Data. 200-214 - Fabio Carrara

, Claudio Gennaro
, Lucia Vadicamo
, Giuseppe Amato
:
Vec2Doc: Transforming Dense Vectors into Sparse Representations for Efficient Information Retrieval. 215-222 - Richard Connor

, Alan Dearle
, David Morrison
, Edgar Chávez
:
Similarity Search with Multiple-Object Queries. 223-237 - Yasin N. Silva, Juan Martinez, Pedro Castro Cea, Humberto Luiz Razente

, Maria Camila Nardini Barioni:
Diversity Similarity Join for Big Data. 238-252
Indexing Challenge
- Eric Sadit Tellez

, Martin Aumüller
, Edgar Chávez
:
Overview of the SISAP 2023 Indexing Challenge. 255-264 - Christoffer J. W. Romild, Thomas H. Schauser, Joachim Alexander Borup:

Enhancing Approximate Nearest Neighbor Search: Binary-Indexed LSH-Tries, Trie Rebuilding, and Batch Extraction. 265-272 - Yutaro Oguri

, Yusuke Matsui
:
General and Practical Tuning Method for Off-the-Shelf Graph-Based Index: SISAP Indexing Challenge Report by Team UTokyo. 273-281 - Terézia Slanináková

, David Procházka
, Matej Antol
, Jaroslav Olha
, Vlastislav Dohnal
:
SISAP 2023 Indexing Challenge - Learned Metric Index. 282-290 - Cole Foster, Benjamin B. Kimia:

Computational Enhancements of HNSW Targeted to Very Large Datasets. 291-299 - Vladimir Mic

, Jan Sedmidubský
, Pavel Zezula
:
CRANBERRY: Memory-Effective Search in 100M High-Dimensional CLIP Vectors. 300-308

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














