Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Return of the lernaean hydra: Experimental evaluation of data series approximate similarity search
Data series are a special type of multidimensional data present in numerous domains,
where similarity search is a key operation that has been extensively studied in the data …
where similarity search is a key operation that has been extensively studied in the data …
Engineering efficient and effective non-metric space library
L Boytsov, B Naidan - Similarity Search and Applications: 6th International …, 2013 - Springer
We present a new similarity search library and discuss a variety of design and performance
issues related to its development. We adopt a position that engineering is equally important …
issues related to its development. We adopt a position that engineering is equally important …
Metric index: An efficient and scalable solution for precise and approximate similarity search
Metric space is a universal and versatile model of similarity that can be applied in various
areas of information retrieval. However, a general, efficient, and scalable solution for metric …
areas of information retrieval. However, a general, efficient, and scalable solution for metric …
Hd-index: Pushing the scalability-accuracy boundary for approximate knn search in high-dimensional spaces
Nearest neighbor searching of large databases in high-dimensional spaces is inherently
difficult due to the curse of dimensionality. A flavor of approximation is, therefore, necessary …
difficult due to the curse of dimensionality. A flavor of approximation is, therefore, necessary …
A hybrid reverse engineering approach combining metrics and program visualisation
Surprising as it may seem, many of the early adopters of the object-oriented paradigm
already face a number of problems typically encountered in large-scale legacy systems …
already face a number of problems typically encountered in large-scale legacy systems …
Permutation search methods are efficient, yet faster search is possible
We survey permutation-based methods for approximate k-nearest neighbor search. In these
methods, every data point is represented by a ranked list of pivots sorted by the distance to …
methods, every data point is represented by a ranked list of pivots sorted by the distance to …
MI-File: using inverted files for scalable approximate similarity search
We propose a new efficient and accurate technique for generic approximate similarity
searching, based on the use of inverted files. We represent each object of a dataset by the …
searching, based on the use of inverted files. We represent each object of a dataset by the …
[KÖNYV][B] Visual information retrieval using java and lire
Visual information retrieval (VIR) is an active and vibrant research area, which attempts at
providing means for organizing, indexing, annotating, and retrieving visual information …
providing means for organizing, indexing, annotating, and retrieving visual information …
Content based image retrieval with lire
M Lux - Proceedings of the 19th ACM international conference …, 2011 - dl.acm.org
LIRe (Lucene Image Retrieval) is an open source library for content based image retrieval.
Besides providing multiple common and state of the art retrieval mechanisms it allows for …
Besides providing multiple common and state of the art retrieval mechanisms it allows for …
Use of permutation prefixes for efficient and scalable approximate similarity search
A Esuli - Information Processing & Management, 2012 - Elsevier
We present the Permutation Prefix Index (this work is a revised and extended version of
Esuli (2009b), presented at the 2009 LSDS-IR Workshop, held in Boston)(PP-Index), an …
Esuli (2009b), presented at the 2009 LSDS-IR Workshop, held in Boston)(PP-Index), an …