A central problem in computational geometry, range searching arises in many applications,
and a variety of geometric problems can be formulated as range-searching problems. A …

We are being constantly judged by automated decision systems that have been widely
criticised for being discriminatory and unfair. Since an algorithm is only as good as the data …

Popular fine-grained hypotheses have been successful in proving conditional lower bounds
for many dynamic problems. Two of the most widely applicable hypotheses in this context …

Data partitioning that maximizes or minimizes Shannon entropy is a crucial subroutine in
data compression, columnar storage, and cardinality estimation algorithms. These partition …

Let P be a set of n uncertain points in R d, where each point pi∈ P is associated with a real
value vi and exists with probability α i∈(0, 1] independently of the other points. We present …

A user sometimes prefers to not be restricted when querying for information. Querying
information within a range of search often provides a different perspective to user as …

Let P be a set of n uncertain points in Red, where each point pi∈ P is associated with a real
value vi and a probability αi∈(0, 1] of existence, ie, each pi exists with an independent …

To obtain a different perspective, a user often would query information in a range of search
rather than a fixed search. However, the issue arises when attempting to compute skyline on …

A range-skyline query (RSQ) is the combination of range query and skyline query. It is one of
the practical query types in multicriteria decision services, which may include the spatial and …

Range closest-pair (RCP) search is a range-search variant of the classical closest-pair
problem, which aims to store a given set S of points into some space-efficient data structure …