Abstract is missing.
- Finding HSP Neighbors via an Exact, Hierarchical ApproachCole Foster, Edgar Chávez, Benjamin B. Kimia. 3-18 [doi]
- Approximate Similarity Search for Time Series Data Enhanced by Section Min-HashRyota Tomoda, Hisashi Koga. 19-32 [doi]
- Mutual k-Nearest Neighbor Graph for Data Analysis: Application to Metric Space ClusteringEdgar Chávez, Stéphane Marchand-Maillet, Adolfo J. Quiroz. 33-40 [doi]
- An Alternating Optimization Scheme for Binary Sketches for Cosine Similarity SearchErik Thordsen, Erich Schubert. 41-55 [doi]
- Unbiased Similarity Estimators Using SamplesConrado Martínez, Alfredo Viola, Jun Wang. 56-63 [doi]
- Retrieve-and-Rank End-to-End Summarization of Biomedical StudiesGianluca Moro, Luca Ragazzi, Lorenzo Valgimigli, Lorenzo Molfetta. 64-78 [doi]
- Fine-Grained Categorization of Mobile Applications Through Semantic Similarity Techniques for Apps ClassificationElena Flondor, Marc Frîncu. 79-87 [doi]
- Runs of Side-Sharing Tandems in Rectangular ArraysShoshana Marcus, Dina Sokol, Sarah Zelikovitz. 88-102 [doi]
- Turbo Scan: Fast Sequential Nearest Neighbor Search in High DimensionsEdgar Chávez, Eric Sadit Tellez. 103-110 [doi]
- Class Representatives Selection in Non-metric Spaces for Nearest Prototype ClassificationJaroslav Hlavác, Martin Kopp, Jan Kohout, Tomás Skopal. 111-124 [doi]
- The Dataset-Similarity-Based Approach to Select Datasets for Evaluation in Similarity RetrievalMatheus A. L. Matiazzo, Vitor de Castro-Silva, Rafael Seidi Oyamada, Daniel S. Kaster. 125-132 [doi]
- Suitability of Nearest Neighbour Indexes for Multimedia Relevance FeedbackOmar Shahbaz Khan, Martin Aumüller 0001, Björn Þór Jónsson 0001. 133-147 [doi]
- Accelerating k-Means Clustering with Cover TreesAndreas Lang 0002, Erich Schubert. 148-162 [doi]
- Is Quantized ANN Search Cursed? Case Study of Quantifying Search and Index QualityGylfi Þór Guðmundsson, Björn Þór Jónsson 0001. 163-170 [doi]
- Minwise-Independent Permutations with Insertion and Deletion of FeaturesRameshwar Pratap, Raghav Kulkarni. 171-184 [doi]
- SDOclust: Clustering with Sparse Data ObserversFélix Iglesias, Tanja Zseby, Alexander Hartl, Arthur Zimek. 185-199 [doi]
- Solving k-Closest Pairs in High-Dimensional DataMartin Aumüller 0001, Matteo Ceccarello. 200-214 [doi]
- Vec2Doc: Transforming Dense Vectors into Sparse Representations for Efficient Information RetrievalFabio Carrara, Claudio Gennaro, Lucia Vadicamo, Giuseppe Amato 0001. 215-222 [doi]
- Similarity Search with Multiple-Object QueriesRichard Connor 0001, Alan Dearle, David Morrison, Edgar Chávez. 223-237 [doi]
- Diversity Similarity Join for Big DataYasin N. Silva, Juan Martinez, Pedro Castro Cea, Humberto Luiz Razente, Maria Camila Nardini Barioni. 238-252 [doi]
- Overview of the SISAP 2023 Indexing ChallengeEric Sadit Tellez, Martin Aumüller 0001, Edgar Chávez. 255-264 [doi]
- Enhancing Approximate Nearest Neighbor Search: Binary-Indexed LSH-Tries, Trie Rebuilding, and Batch ExtractionChristoffer J. W. Romild, Thomas H. Schauser, Joachim Alexander Borup. 265-272 [doi]
- General and Practical Tuning Method for Off-the-Shelf Graph-Based Index: SISAP Indexing Challenge Report by Team UTokyoYutaro Oguri, Yusuke Matsui. 273-281 [doi]
- SISAP 2023 Indexing Challenge - Learned Metric IndexTerézia Slanináková, David Procházka, Matej Antol, Jaroslav Olha, Vlastislav Dohnal. 282-290 [doi]
- Computational Enhancements of HNSW Targeted to Very Large DatasetsCole Foster, Benjamin B. Kimia. 291-299 [doi]
- CRANBERRY: Memory-Effective Search in 100M High-Dimensional CLIP VectorsVladimir Mic, Jan Sedmidubský, Pavel Zezula. 300-308 [doi]