In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
In this paper, we propose a new tunable index scheme, called iMinMax, that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
Hyperbolic cross approximations by some classical orthogonal polynomials/functions in both bounded and unbounded domains are considered in this paper. Optimal error estimates in pr...