![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 27 matches
- 2023
- Martin Aumüller
, Matteo Ceccarello
:
Solving k-Closest Pairs in High-Dimensional Data. SISAP 2023: 200-214 - Fabio Carrara
, Claudio Gennaro
, Lucia Vadicamo
, Giuseppe Amato
:
Vec2Doc: Transforming Dense Vectors into Sparse Representations for Efficient Information Retrieval. SISAP 2023: 215-222 - Edgar Chávez
, Stéphane Marchand-Maillet
, Adolfo J. Quiroz
:
Mutual k-Nearest Neighbor Graph for Data Analysis: Application to Metric Space Clustering. SISAP 2023: 33-40 - Edgar Chávez
, Eric Sadit Tellez
:
Turbo Scan: Fast Sequential Nearest Neighbor Search in High Dimensions. SISAP 2023: 103-110 - Richard Connor
, Alan Dearle
, David Morrison
, Edgar Chávez
:
Similarity Search with Multiple-Object Queries. SISAP 2023: 223-237 - Elena Flondor
, Marc Frîncu
:
Fine-Grained Categorization of Mobile Applications Through Semantic Similarity Techniques for Apps Classification. SISAP 2023: 79-87 - Cole Foster, Edgar Chávez, Benjamin B. Kimia:
Finding HSP Neighbors via an Exact, Hierarchical Approach. SISAP 2023: 3-18 - Cole Foster, Benjamin B. Kimia:
Computational Enhancements of HNSW Targeted to Very Large Datasets. SISAP 2023: 291-299 - Gylfi Þór Guðmundsson
, Björn Þór Jónsson
:
Is Quantized ANN Search Cursed? Case Study of Quantifying Search and Index Quality. SISAP 2023: 163-170 - Jaroslav Hlavác
, Martin Kopp
, Jan Kohout, Tomás Skopal
:
Class Representatives Selection in Non-metric Spaces for Nearest Prototype Classification. SISAP 2023: 111-124 - Félix Iglesias
, Tanja Zseby
, Alexander Hartl
, Arthur Zimek
:
SDOclust: Clustering with Sparse Data Observers. SISAP 2023: 185-199 - Omar Shahbaz Khan
, Martin Aumüller
, Björn Þór Jónsson
:
Suitability of Nearest Neighbour Indexes for Multimedia Relevance Feedback. SISAP 2023: 133-147 - Andreas Lang
, Erich Schubert
:
Accelerating k-Means Clustering with Cover Trees. SISAP 2023: 148-162 - Shoshana Marcus, Dina Sokol
, Sarah Zelikovitz:
Runs of Side-Sharing Tandems in Rectangular Arrays. SISAP 2023: 88-102 - Conrado Martínez
, Alfredo Viola
, Jun Wang
:
Unbiased Similarity Estimators Using Samples. SISAP 2023: 56-63 - 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. SISAP 2023: 125-132 - Vladimir Mic
, Jan Sedmidubský
, Pavel Zezula
:
CRANBERRY: Memory-Effective Search in 100M High-Dimensional CLIP Vectors. SISAP 2023: 300-308 - Gianluca Moro
, Luca Ragazzi
, Lorenzo Valgimigli
, Lorenzo Molfetta:
Retrieve-and-Rank End-to-End Summarization of Biomedical Studies. SISAP 2023: 64-78 - Yutaro Oguri
, Yusuke Matsui
:
General and Practical Tuning Method for Off-the-Shelf Graph-Based Index: SISAP Indexing Challenge Report by Team UTokyo. SISAP 2023: 273-281 - Rameshwar Pratap
, Raghav Kulkarni:
Minwise-Independent Permutations with Insertion and Deletion of Features. SISAP 2023: 171-184 - Christoffer J. W. Romild, Thomas H. Schauser, Joachim Alexander Borup:
Enhancing Approximate Nearest Neighbor Search: Binary-Indexed LSH-Tries, Trie Rebuilding, and Batch Extraction. SISAP 2023: 265-272 - Yasin N. Silva, Juan Martinez, Pedro Castro Cea, Humberto Luiz Razente
, Maria Camila Nardini Barioni:
Diversity Similarity Join for Big Data. SISAP 2023: 238-252 - Terézia Slanináková
, David Procházka
, Matej Antol
, Jaroslav Olha
, Vlastislav Dohnal
:
SISAP 2023 Indexing Challenge - Learned Metric Index. SISAP 2023: 282-290 - Eric Sadit Tellez
, Martin Aumüller
, Edgar Chávez
:
Overview of the SISAP 2023 Indexing Challenge. SISAP 2023: 255-264 - Erik Thordsen
, Erich Schubert
:
An Alternating Optimization Scheme for Binary Sketches for Cosine Similarity Search. SISAP 2023: 41-55 - Ryota Tomoda, Hisashi Koga:
Approximate Similarity Search for Time Series Data Enhanced by Section Min-Hash. SISAP 2023: 19-32 - 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 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-02 09:54 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint