research
∙
06/15/2023
Neural Network Compression using Binarization and Few Full-Precision Weights
Quantization and pruning are known to be two effective Deep Neural Netwo...
share
research
∙
02/18/2023
Faster Wavelet Trees with Quad Vectors
Given a text, rank and select queries return the number of occurrences o...
research
∙
11/26/2021
An Optimal Algorithm for Finding Champions in Tournament Graphs
A tournament graph T = (V, E ) is an oriented complete graph, which can ...
research
∙
11/13/2020
Substring Query Complexity of String Reconstruction
Suppose an oracle knows a string S that is unknown to us and we want to ...
research
∙
06/25/2020
Practical Trade-Offs for the Prefix-Sum Problem
Given an integer array A, the prefix-sum problem is to answer sum(i) que...
research
∙
05/13/2020
Efficient and Effective Query Auto-Completion
Query Auto-Completion (QAC) is an ubiquitous feature of modern textual s...
research
∙
03/26/2020
Succinct Dynamic Ordered Sets with Random Access
The representation of a dynamic ordered set of n integer keys drawn from...
research
∙
08/28/2019
Techniques for Inverted Index Compression
The data structure at the core of large-scale search engines is the inve...
research
∙
04/16/2019
Compressed Indexes for Fast Search of Semantic Data
The sheer increase in volume of RDF data demands efficient solutions for...
research
∙
06/25/2018
Handling Massive N-Gram Datasets Efficiently
This paper deals with the two fundamental problems concerning the handli...
research
∙
04/29/2018
