Quantized ranking for permutation-based indexing
Authors:
- Hisham MohamedHMHisham Mohamed
- Stéphane Marchand-MailletSMStéphane Marchand-Maillet
- 1 August 2015
- journal article
- conference paper
- Published by Elsevier in Information Systems
- Vol. 52, 163-175
Abstract
No abstract availableKeywords
Funding Information
- Swiss National Science Foundation (SNSF) via the Swiss National Center of Competence in Research (NCCR) on Interactive Multimodal Information Management (IM2)
- European COST Action on Multilingual and Multifaceted Interactive Information Access (MUMIA) via the Swiss State Secretariat for Education and Research (SER)
This publication has 28 references indexed in Scilit:
- MI-File: using inverted files for scalable approximate similarity searchMultimedia Tools and Applications, 2012
- Succinct nearest neighbor searchInformation Systems, 2012
- MiPai: Using the PP-Index to Build an Efficient and Scalable Similarity Search System2009
- Approximate similarity search: A multi-faceted problemJournal of Discrete Algorithms, 2009
- Effective Proximity Retrieval by Ordering PermutationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- Searching in metric spacesACM Computing Surveys, 2001
- Approximate nearest neighbors1998
- Similarity-based queries1995
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad treesActa Informatica, 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975