{"total":39,"rows":[{"id":"2401.08281","title":"The Faiss library","created":"2024-01-16","cited_by_count":376,"area":null},{"id":"2106.00882","title":"Efficient Passage Retrieval with Hashing for Open-domain Question Answering","created":"2021-06-02","cited_by_count":53,"area":null},{"id":"2109.14449","title":"One Loss for All: Deep Hashing with a Single Cosine Similarity based Learning Objective","created":"2021-09-29","cited_by_count":43,"area":null},{"id":"2106.10860","title":"Multiplying Matrices Without Multiplying","created":"2021-06-21","cited_by_count":30,"area":null},{"id":"2110.14094","title":"Learning-Augmented $k$-means Clustering","created":"2021-10-27","cited_by_count":26,"area":null},{"id":"2203.09572","title":"Triangle and Four Cycle Counting with Predictions in Graph Streams","created":"2022-03-17","cited_by_count":20,"area":null},{"id":"2310.19126","title":"Worst-case Performance of Popular Approximate Nearest Neighbor Search Implementations: Guarantees and Limitations","created":"2023-10-29","cited_by_count":20,"area":null},{"id":"2101.08769","title":"Item Recommendation from Implicit Feedback","created":"2021-01-21","cited_by_count":18,"area":null},{"id":"2206.14286","title":"TPU-KNN: K Nearest Neighbor Search at Peak FLOP/s","created":"2022-06-28","cited_by_count":18,"area":null},{"id":"2106.08396","title":"Learning-based Support Estimation in Sublinear Time","created":"2021-06-15","cited_by_count":16,"area":null},{"id":"2110.11439","title":"(Optimal) Online Bipartite Matching with Degree Information","created":"2021-10-21","cited_by_count":11,"area":null},{"id":"2203.15287","title":"Accelerating Code Search with Deep Hashing and Code Classification","created":"2022-03-29","cited_by_count":10,"area":null},{"id":"2312.07535","title":"Improved Frequency Estimation Algorithms with and without Predictions","created":"2023-12-12","cited_by_count":10,"area":null},{"id":"2202.03384","title":"Hybrid Contrastive Quantization for Efficient Cross-View Video Retrieval","created":"2022-02-07","cited_by_count":8,"area":null},{"id":"2106.01487","title":"LLC: Accurate, Multi-purpose Learnt Low-dimensional Binary Codes","created":"2021-06-02","cited_by_count":7,"area":null},{"id":"2108.05433","title":"Learning to Hash Robustly, Guaranteed","created":"2021-08-11","cited_by_count":7,"area":null},{"id":"2103.14460","title":"Unsupervised Multi-Index Semantic Hashing","created":"2021-03-26","cited_by_count":5,"area":null},{"id":"2112.09568","title":"Nearest neighbor search with compact codes: A decoder perspective","created":"2021-12-17","cited_by_count":5,"area":null},{"id":"2209.11475","title":"Unsupervised Hashing with Semantic Concept Mining","created":"2022-09-23","cited_by_count":5,"area":null},{"id":"2310.03919","title":"An Efficient Content-based Time Series Retrieval System","created":"2023-10-05","cited_by_count":5,"area":null},{"id":"2109.05206","title":"PHPQ: Pyramid Hybrid Pooling Quantization for Efficient Fine-Grained Image Retrieval","created":"2021-09-11","cited_by_count":3,"area":null},{"id":"2208.06866","title":"HyP$^2$ Loss: Beyond Hypersphere Metric Space for Multi-label Image Retrieval","created":"2022-08-14","cited_by_count":3,"area":null},{"id":"2507.08404","title":"Deep Hashing with Semantic Hash Centers for Image Retrieval","created":"2025-07-11","cited_by_count":3,"area":null},{"id":"2407.16466","title":"Sobolev neural network with residual weighting as a surrogate in linear and non-linear mechanics","created":"2024-07-23","cited_by_count":2,"area":null},{"id":"2111.04086","title":"Meta Cross-Modal Hashing on Long-Tailed Data","created":"2021-11-07","cited_by_count":1,"area":null},{"id":"2206.08091","title":"Unsupervised Space Partitioning for Nearest Neighbor Search","created":"2022-06-16","cited_by_count":1,"area":null},{"id":"2210.04288","title":"CoopHash: Cooperative Learning of Multipurpose Descriptor and Contrastive Pair Generator via Variational MCMC Teaching for Supervised Image Hashing","created":"2022-10-09","cited_by_count":1,"area":null},{"id":"2304.02488","title":"SCB-Dataset: A Dataset for Detecting Student and Teacher Classroom Behavior","created":"2023-04-05","cited_by_count":1,"area":null},{"id":"2406.05830","title":"Probabilistic Approach to Black-Box Binary Optimization with Budget Constraints: Application to Sensor Placement","created":"2024-06-09","cited_by_count":1,"area":null},{"id":"2108.02560","title":"Online Hashing with Similarity Learning","created":"2021-07-04","cited_by_count":0,"area":null},{"id":"2203.09420","title":"Deep Unsupervised Hashing with Latent Semantic Components","created":"2022-03-17","cited_by_count":0,"area":null},{"id":"2210.07572","title":"Cross-Scale Context Extracted Hashing for Fine-Grained Image Binary Encoding","created":"2022-10-14","cited_by_count":0,"area":null},{"id":"2305.04710","title":"ElasticHash: Semantic Image Similarity Search by Deep Hashing with Elasticsearch","created":"2023-05-08","cited_by_count":0,"area":null},{"id":"2306.06928","title":"Sparse-Inductive Generative Adversarial Hashing for Nearest Neighbor Search","created":"2023-06-12","cited_by_count":0,"area":null},{"id":"2311.02560","title":"Temporal Treasure Hunt: Content-based Time Series Retrieval System for Discovering Insights","created":"2023-11-05","cited_by_count":0,"area":null},{"id":"2411.03253","title":"Discovering Data Structures: Nearest Neighbor Search and Beyond","created":"2024-11-05","cited_by_count":0,"area":null},{"id":"2505.17844","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","created":"2025-05-23","cited_by_count":0,"area":null},{"id":"2505.24608","title":"GARLIC: GAussian Representation LearnIng for spaCe partitioning","created":"2025-05-30","cited_by_count":0,"area":null},{"id":"2607.06148","title":"RFHNet: Relational and Frequency-Aware Hashing Network for Large-Scale Fine-Grained Food Image Retrieval","created":"2026-07-07","cited_by_count":0,"area":null}],"next_cursor":null}