AbstractWe present two new algorithms for the range-efficient F0 estimating problem and improve the previously best known result, proposed by Pavan and Tirthapura in 2005. Furthermore, our algorithms can be applied to improve the previously best known result for the Max-Dominance Norm Problem
This electronic version was submitted by the student author. The certified thesis is available in th...
We present linear-space sublogarithmic algorithms for handling the {\em three-dimensional dominance...
In insertion-only streaming, one sees a sequence of indices a_1, a_2, ..., a_m in [n]. The stream de...
AbstractWe present two new algorithms for the range-efficient F0 estimating problem and improve the ...
This paper develops a new mathematical-statistical approach to analyze a class of Flajolet-Martin al...
Consider a set of signals fs: {1,..., N} → [0,...,M] appearing as a stream of tuples (i, fs(i)) in ...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
Max-stable random sketches can be computed efficiently on fast streaming positive data sets by using...
In this paper, we provide the first optimal algorithm for the remaining open question from the semin...
We give a one-pass, O~(m^{1-2/k})-space algorithm for estimating the k-th frequency moment of a data...
In this paper, we study the maximum density, threshold and emptiness queries for intervals in the s...
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of m...
The exact computation of the number of distinct elements (frequency moment F0) is a fundamental prob...
The basic problem of interval computations is: given a function f(x1,...,xn) and n intervals [xi-,xi...
The l_2 tracking problem is the task of obtaining a streaming algorithm that, given access to a stre...
This electronic version was submitted by the student author. The certified thesis is available in th...
We present linear-space sublogarithmic algorithms for handling the {\em three-dimensional dominance...
In insertion-only streaming, one sees a sequence of indices a_1, a_2, ..., a_m in [n]. The stream de...
AbstractWe present two new algorithms for the range-efficient F0 estimating problem and improve the ...
This paper develops a new mathematical-statistical approach to analyze a class of Flajolet-Martin al...
Consider a set of signals fs: {1,..., N} → [0,...,M] appearing as a stream of tuples (i, fs(i)) in ...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
Max-stable random sketches can be computed efficiently on fast streaming positive data sets by using...
In this paper, we provide the first optimal algorithm for the remaining open question from the semin...
We give a one-pass, O~(m^{1-2/k})-space algorithm for estimating the k-th frequency moment of a data...
In this paper, we study the maximum density, threshold and emptiness queries for intervals in the s...
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of m...
The exact computation of the number of distinct elements (frequency moment F0) is a fundamental prob...
The basic problem of interval computations is: given a function f(x1,...,xn) and n intervals [xi-,xi...
The l_2 tracking problem is the task of obtaining a streaming algorithm that, given access to a stre...
This electronic version was submitted by the student author. The certified thesis is available in th...
We present linear-space sublogarithmic algorithms for handling the {\em three-dimensional dominance...
In insertion-only streaming, one sees a sequence of indices a_1, a_2, ..., a_m in [n]. The stream de...
DOI
Add to ORKG