Advances in data gathering have led to the creation of very large collections across different fields like industrial site sensor measurements or the account statuses of a financial institution’s clients. The ability to learn classification rules, rules that associate specific attribute values with a specific class label, from this data is important and useful in a range of applications. While ...

In the path minimum query problem, we preprocess a tree on n weighted nodes, such that given an arbitrary path, we can locate the node with the smallest weight along this path. We design novel succinct indices for this problem; one of our index structures supports queries in O(α(m,n)) time, and occupiesO(m) bits of space in addition to the space required for the input tree, where m is an intege...

We present data structures for triangular emptiness and reporting queries for a planar point set, where the query triangle contains the origin. The data structures use near-linear space and achieve polylogarithmic query times.

In [10, 18] the transformation technique has been proposed to store k-dimensional intervals { which serve as bounding boxes for arbitrary geometric objects in many applications { as 2k-dimensional points in a point access structure. Unfortunately the transformation technique has two pitfalls: (1) The transformation leads to a skew distribution of the 2k-dimensional image points. (2) Processing ...

Data obfuscation techniques transforms data into other data that are harder to understand. These techniques are receiving an increasing amount of attention, largely due to their applications in different areas. We illustrate an approach for obfuscating data that guarantees protection of data while allowing the execution of both equality and range queries on the obfuscated data.

In this paper we propose a test statistic to discriminate between models with finite variance and models with infinite variance. The test statistic is the ratio of the sample standard deviation and the sample interquartile range. Both asymptotic and finite sample properties of the test statistic are discussed. We show that the test has good power properties against infinite-variance distributio...

In a top-k Geometric Intersection Query (top-k GIQ) problem, a set of n weighted, geometric objects in Rd is to be pre-processed into a compact data structure so that for any query geometric object, q, and integer k > 0, the k largest-weight objects intersected by q can be reported efficiently. While the top-k problem has been studied extensively for non-geometric problems (e.g., recommender sy...

A simple algorithm for tracking the pose of articulated objects in real-time range image sequences is proposed. This method models each target segment as a planar patch bounded by the convex hull of two circles, and utilizes both edge-like and region-like information in matching the model to the target. It uses hard constraints for joint attachment, and is designed to be robust to occlusions an...

In this paper we study order-preserving encryption (OPE), a primitive in the database community for allowing efficient range queries on ecrypted data. OPE was suggested by Agrawal et al [1], and was throughly studied by Boldyreva et al [2]. In this paper we present a practical OPE scheme, which is a key-controlled algorithm, based on simple computation. A primary analysis shows that our algorit...

The construction of a range restricted bivariate C ( or G ) interpolant to scattered data is considered in which the interpolant is positive everywhere if the original data are positive. This study is motivated by earlier work in which sufficient conditions are derived on Bézier points in order to ensure that surfaces comprising cubic Bézier triangular patches are always positive and satisfy C ...