Search Results

Given an array of size n from a total order, we consider the problem of constructing a data structure that supports various queries (range minimum/maximum queries with their variants and next/previous larger/smaller queries) efficiently. In the ...$\mathrm{}$${}^{}$$$${}^{\mathrm{}}$$\mathrm{}$${}^{}{}^{\mathrm{}}$$\mathrm{}\mathrm{}$$\mathrm{}\mathrm{}$

We consider the problem of encoding two-dimensional arrays, whose elements come from a total order, for answering $\text{Top-}k$ queries. The aim is to obtain encodings that use space close to the information-theoretic lower bound, which can be constructed ...$$$$$\mathsf{}$$\mathrm{}\mathrm{}$$\mathrm{}$$\mathsf{}$$\left(\genfrac{}{}{0pt}{}{\mathrm{}}{}\right)\mathrm{}\mathrm{}$$$$$$\mathsf{}$

The visual encoding model based on the convolutional neural network (CNN) realizes the prediction of brain activity from the hierarchical similarity between deep neural network and visual cortex. However, studies have shown that CNNs trained on the ...

We study the problem of storing the minimum number of bits required to answer next/previous larger/smaller value queries on an array A of n numbers, without storing A. We show that these queries can be answered by storing at most 3.701...

• We study the effective entropy of next/previous larger/smaller queries on an array.

We consider the two-dimensional range maximum query (2D-RMQ) problem: given an array containing elements from an ordered set, encode the array so that the position of the maximum element in any specified range of rows and range of columns can be found ...

Given a sequence of n elements from a totally ordered set, and a position in the sequence, the nearest larger neighbor (NLN) query returns the position of the element which is closest to the query position, and is larger than the element at the query ...

The two dimensional range minimum query problem is to preprocess a static m by n matrix (two dimensional array) A of size N=mźn, such that subsequent queries, asking for the position of the minimum element in a rectangular range within A, can be ...