Abstract is missing.
- Evolving Models of Biological Sequence SimilarityDaniel P. Miranker. 3-9 [doi]
- The Many Facets of Approximate Similarity SearchMarco Patella, Paolo Ciaccia. 10-21 [doi]
- HiPeR: Hierarchical Progressive Exact Retrieval in Multidimensional SpacesNouha Bouteldja, Valérie Gouet-Brunet, Michel Scholl. 25-34 [doi]
- High-Dimensional Similarity Retrieval Using Dimensional ChoiceDave Tahmoush, Hanan Samet. 35-42 [doi]
- Approximate Similarity Search in Genomic Sequence Databases Using Landmark-Guided EmbeddingAhmet Sacan, Ismail Hakki Toroslu. 43-50 [doi]
- Visual Similarity in Sign LanguageJan Ulrych, Michal Kopecky. 53-60 [doi]
- A Contextual Normalised Edit DistanceColin de la Higuera, Luisa Micó. 61-68 [doi]
- Counting Distance PermutationsMatthew Skala. 69-76 [doi]
- Combining Metric Features in Large CollectionsMichal Batko, Petra Kohoutkova, Pavel Zezula. 79-86 [doi]
- Similarity Searching: Towards Bulk-Loading Peer-to-Peer NetworksVlastislav Dohnal, Jan Sedmidubský, Pavel Zezula, David Novak. 87-94 [doi]
- An Empirical Evaluation of a Distributed Clustering-Based Index for Metric Space DatabasesVeronica Gil Costa, Mauricio MarÃn, Nora Reyes. 95-102 [doi]
- A Dynamic Pivot Selection Technique for Similarity SearchBenjamin Bustos, Oscar Pedreira, Nieves R. Brisaboa. 105-112 [doi]
- Effective Use of Space for Pivot-Based Metric Indexing StructuresCengiz Celik. 113-120 [doi]
- On Reinsertions in M-treeJakub Lokoc, Tomás Skopal. 121-128 [doi]
- List of Twin Clusters: A Data Structure for Similarity Joins in Metric SpacesRodrigo Paredes, Nora Reyes. 131-138 [doi]
- Anytime K-Nearest Neighbor Search for Database ApplicationsWeijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. Ramakrishnan. 139-148 [doi]
- On the Complexity of Reverse Similarity SearchMatthew Skala. 149-156 [doi]