Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search
M Wang, X Xu, Q Yue, Y Wang - ar**: A survey on visual loop closure detection
KA Tsintotas, L Bampis… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Where am I? This is one of the most critical questions that any intelligent system should
answer to decide whether it navigates to a previously visited area. This problem has long …
answer to decide whether it navigates to a previously visited area. This problem has long …
Milvus: A purpose-built vector data management system
Recently, there has been a pressing need to manage high-dimensional vector data in data
science and AI applications. This trend is fueled by the proliferation of unstructured data and …
science and AI applications. This trend is fueled by the proliferation of unstructured data and …
Learning deep representation for imbalanced classification
Data in vision domain often exhibit highly-skewed class distribution, ie, most data belong to
a few majority classes, while the minority classes only contain a scarce amount of instances …
a few majority classes, while the minority classes only contain a scarce amount of instances …
Deep imbalanced learning for face recognition and attribute prediction
Data for face analysis often exhibit highly-skewed class distribution, ie, most data belong to
a few majority classes, while the minority classes only contain a scarce amount of instances …
a few majority classes, while the minority classes only contain a scarce amount of instances …
[PDF][PDF] Accelerating t-SNE using tree-based algorithms
L Van Der Maaten - The journal of machine learning research, 2014 - jmlr.org
The paper investigates the acceleration of t-SNE—an embedding technique that is
commonly used for the visualization of high-dimensional data in scatter plots—using two …
commonly used for the visualization of high-dimensional data in scatter plots—using two …
Scalable nearest neighbor algorithms for high dimensional data
For many computer vision and machine learning problems, large training sets are key for
good performance. However, the most computationally expensive part of many computer …
good performance. However, the most computationally expensive part of many computer …
Visualizing large-scale and high-dimensional data
We study the problem of visualizing large-scale and high-dimensional data in a low-
dimensional (typically 2D or 3D) space. Much success has been reported recently by …
dimensional (typically 2D or 3D) space. Much success has been reported recently by …