Search Results for author:
Found 11 papers, 10 papers with code
Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations
In this work, we propose a novel organization of the inverted index that enables fast yet effective approximate retrieval over learned sparse embeddings.
Efficient Multi-Vector Dense Retrieval Using Bit Vectors
This paper proposes ``Efficient Multi-Vector dense retrieval with Bit vectors'' (EMVB), a novel framework for efficient query processing in multi-vector dense retrieval.
Neural Network Compression using Binarization and Few Full-Precision Weights
Quantization and pruning are two effective Deep Neural Networks model compression methods.
An Optimal Algorithm for Finding Champions in Tournament Graphs
In this paper, we address the problem of finding a champion of the tournament, also known as Copeland winner, which is a player that wins the highest number of matches.
Efficient and Effective Query Auto-Completion
Query Auto-Completion (QAC) is an ubiquitous feature of modern textual search systems, suggesting possible ways of completing the query being typed by the user.
Techniques for Inverted Index Compression
The aim of this article is twofold: first, surveying the encoding algorithms suitable for inverted index compression and, second, characterizing the performance of the inverted index through experimentation.
Compressed Indexes for Fast Search of Semantic Data
The sheer increase in volume of RDF data demands efficient solutions for the triple indexing problem, that is devising a compressed data structure to compactly represent RDF triples by guaranteeing, at the same time, fast pattern matching operations.
Handling Massive N-Gram Datasets Efficiently
This paper deals with the two fundamental problems concerning the handling of large n-gram language models: indexing, that is compressing the n-gram strings and associated satellite data without compromising their retrieval speed; and estimation, that is computing the probability distribution of the strings from a large textual source.
On Optimally Partitioning Variable-Byte Codes
The ubiquitous Variable-Byte encoding is one of the fastest compressed representation for integer sequences.
Cache-Oblivious Peeling of Random Hypergraphs
The computation of a peeling order in a randomly generated hypergraph is the most time-consuming step in a number of constructions, such as perfect hashing schemes, random $r$-SAT solvers, error-correcting codes, and approximate set encodings.
Data Structures and Algorithms
Compressed Text Indexes:From Theory to Practice!
A compressed full-text self-index represents a text in a compressed form and still answers queries efficiently.
Data Structures and Algorithms F.2.2; H.2.1; H.3.2; H.3.3
