Image de couverture de livre

Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Faro, Simone, Pavone, Arianna, Viola, Caterina
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Information Retrieval
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)

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

Hierarchical Locality Sensitive Hashing for Structured Data: A Survey
par: Wu, Wei, et autres
Publié: (2022)

Dynamic Boundary Time Warping for Sub-sequence Matching with Few Examples
par: Borchmann, Łukasz, et autres
Publié: (2020)

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

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

On the LSH Distortion of Ulam and Cayley Similarities
par: Chierichetti, Flavio, et autres
Publié: (2026)

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

Fast and exact fixed-radius neighbor search based on sorting
par: Chen, Xinye, et autres
Publié: (2022)

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

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

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

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

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

Deterministic Retrieval at Scale: Optimal-Space LCP Indexing and 308x Energy Reduction on Modern GPUs
par: Byriukov, Stanislav
Publié: (2026)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
par: Gottesbüren, Lars, 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)

Linked Array Tree: A Constant-Time Search Structure for Big Data
par: Liu, Songpeng
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)

Parallel Algorithms for Median Consensus Clustering in Complex Networks
par: Hussain, Md Taufique, et autres
Publié: (2024)

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

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

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

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

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

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

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

Diversity-Aware $k$-Maximum Inner Product Search Revisited
par: Huang, Qiang, et autres
Publié: (2024)

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

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

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

REWA: A General Theory of Witness-Based Similarity
par: Phadke, Nikit
Publié: (2025)

A Bi-metric Framework for Fast Similarity Search
par: Xu, Haike, et autres
Publié: (2024)

A General Metric-Space Formulation of the Time Warp Edit Distance (TWED)
par: Lau, Zhen Yi
Publié: (2025)

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
par: Basu, Sabyasachi, et autres
Publié: (2024)

Privacy-Preserving Learning-Augmented Data Structures
par: Goyal, Prabhav, et autres
Publié: (2025)

Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
par: Bruch, Sebastian, et autres
Publié: (2025)

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

Time warping with Hellinger elasticity
par: Billig, Yuly
Publié: (2026)