Image de couverture de livre

Diversity-Aware $k$-Maximum Inner Product Search Revisited

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Huang, Qiang, Wang, Yanhao, Sun, Yiqun, Tung, Anthony K. H.
Format:	Preprint
Publié:	2024
Sujets:	Information Retrieval Databases Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
par: Shi, Jifan, et autres
Publié: (2026)

Linked Array Tree: A Constant-Time Search Structure for Big Data
par: Liu, Songpeng
Publié: (2025)

jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
par: Tabei, Yasuo
Publié: (2025)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
par: Iff, Patrick, et autres
Publié: (2025)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
par: Xu, Yuexuan, et autres
Publié: (2024)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
par: Azizi, Ilias, et autres
Publié: (2025)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
par: Wang, Carrie, et autres
Publié: (2025)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
par: Dhulipala, Laxman, et autres
Publié: (2024)

Efficiently Constructing Sparse Navigable Graphs
par: Conway, Alex, et autres
Publié: (2025)

SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
par: Li, Hui, et autres
Publié: (2025)

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
par: Coleman, Benjamin, et autres
Publié: (2023)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
par: Zhao, Fuheng, et autres
Publié: (2023)

TIMEST: Temporal Information Motif Estimator Using Sampling Trees
par: Pan, Yunjie, et autres
Publié: (2025)

Correlation Sketches for Approximate Join-Correlation Queries
par: Santos, Aécio, et autres
Publié: (2021)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
par: Al-Jazzazi, Yousef, et autres
Publié: (2025)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
par: Xu, Zhenxiang, et autres
Publié: (2024)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
par: Pan, Yunjie, et autres
Publié: (2024)

Triadic First-Order Logic Queries in Temporal Networks
par: Bhalerao, Omkar, et autres
Publié: (2025)

Retrieval with Learned Similarities
par: Ding, Bailu, et autres
Publié: (2024)

Model-Free Counterfactual Subset Selection at Scale
par: Nguyen, Minh Hieu, et autres
Publié: (2025)

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
par: Zhang, Ziyu, et autres
Publié: (2025)

Exact Trajectory Similarity Search With N-tree: An Efficient Metric Index for kNN and Range Queries
par: Güting, Ralf Hartmut, et autres
Publié: (2024)

Protecting participants or population? Comparison of k-anonymous Origin-Destination matrices
par: Armenante, Pietro, et autres
Publié: (2025)

COPR -- Efficient, large-scale log storage and retrieval
par: Reichinger, Julian, et autres
Publié: (2024)

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
par: Lin, Wenqing, et autres
Publié: (2025)

Sampling Methods for Inner Product Sketching
par: Daliri, Majid, et autres
Publié: (2023)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
par: Gottesbüren, Lars, et autres
Publié: (2024)

Average Case Graph Searching in Non-Uniform Cost Models
par: Szyfelbein, Michał
Publié: (2026)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
par: Zhang, Tian, et autres
Publié: (2026)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
par: Dhulipala, Laxman, et autres
Publié: (2023)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
par: Yu, Kaiqiang, et autres
Publié: (2025)

Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
par: Bessa, Aline, et autres
Publié: (2023)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
par: Wang, Honglian, et autres
Publié: (2026)

CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs
par: Ootomo, Hiroyuki, et autres
Publié: (2023)

Foundations of Vector Retrieval
par: Bruch, Sebastian
Publié: (2024)

An Effective Tag Assignment Approach for Billboard Advertisement
par: Ali, Dildar, et autres
Publié: (2024)

Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space
par: Lebeda, Christian Janos, et autres
Publié: (2024)

Efficient Inference of Sub-Item Id-based Sequential Recommendation Models with Millions of Items
par: Petrov, Aleksandr V., et autres
Publié: (2024)