Add to ORKGSome of the problems discussed in this paper were used as programming tasks in several national and international Informatics contests. The attached ZIP archive contains materials for some of these tasks.International audienceIn this paper we present several new and very practical methods and techniques for range aggregation and selection problems in multidimensional data structures and other types of sets of values. We also present some new extensions and applications for some fundamental set maintenance problems
This paper studies bundled range aggregation, which is conceptually equivalent to running a range ag...
Let P be a set of n points in Rd. We present a linear-size data structure for answering range querie...
The ability to learn classification rules from data is important and useful in a range of applicatio...
Some of the problems discussed in this paper were used as programming tasks in several national and ...
In the classic range aggregation problem, we have a set S of objects such that, given an interval I,...
Abstract:- In this paper we present several novel efficient techniques and multidimensional data str...
Abstract. In this paper we consider range-aggregate query problems wherein we wish to preprocess a s...
In the orthogonal range searching problem we store a set of input points S in a data structure; the ...
The problem of adding range restrictions to decomposable searching problems is considered. First, a ...
Range searching is one of the central problems in computational geometry, because it arises in many ...
We recently proposed a simple declarative language for specifying a wide range of counting and occur...
This article presents the ways of identification, selection and transformation of the data into othe...
A range query applies an aggregation operation over all selected cells of an OLAP data cube where th...
We present external memory data structures for efficiently answering range-aggregate queries. The ra...
The aim of this paper is to obtain the range set for a given multiobjective linear programming probl...
This paper studies bundled range aggregation, which is conceptually equivalent to running a range ag...
Let P be a set of n points in Rd. We present a linear-size data structure for answering range querie...
The ability to learn classification rules from data is important and useful in a range of applicatio...
Some of the problems discussed in this paper were used as programming tasks in several national and ...
In the classic range aggregation problem, we have a set S of objects such that, given an interval I,...
Abstract:- In this paper we present several novel efficient techniques and multidimensional data str...
Abstract. In this paper we consider range-aggregate query problems wherein we wish to preprocess a s...
In the orthogonal range searching problem we store a set of input points S in a data structure; the ...
The problem of adding range restrictions to decomposable searching problems is considered. First, a ...
Range searching is one of the central problems in computational geometry, because it arises in many ...
We recently proposed a simple declarative language for specifying a wide range of counting and occur...
This article presents the ways of identification, selection and transformation of the data into othe...
A range query applies an aggregation operation over all selected cells of an OLAP data cube where th...
We present external memory data structures for efficiently answering range-aggregate queries. The ra...
The aim of this paper is to obtain the range set for a given multiobjective linear programming probl...
This paper studies bundled range aggregation, which is conceptually equivalent to running a range ag...
Let P be a set of n points in Rd. We present a linear-size data structure for answering range querie...
The ability to learn classification rules from data is important and useful in a range of applicatio...