Enhancing on line analytical processing through efficient cube computation plays a key role in Data Warehouse management. Hashing, grouping and mining techniques are commonly used to improve cube pre-computation. BitCube, a fast cubing method which uses bitmaps as inverted indexes for grouping, is presented. It horizontally partitions data according to the values of one dimension and for each r...

The AD4 project aims to explore and provide an innovative Virtual Air-Space representation for ATM systemswhere 3D representations and real time interaction with air traffic/airport space are accessible to the controllers.This paper describes the D3 (D-cube) Virtual Reality framework and its use in the AD4 project to provideinnovative 4D (spatial-temporal) visualization construc...

The monochromatic single frame pixel count of a camera is limited by diffraction to the space-bandwidth product, roughly the aperture area divided by the square of the wavelength. We have recently shown that it is possible to approach this limit using multiscale lenses for cameras with space bandwidth product between 1 and 100 gigapixels. When color, polarization, coherence and time are include...

Even if one is interested only in finite-dimensional manifolds, the need for infinitedimensional manifolds sometimes arises. For example, one approach to study closed geodesics on a manifold is to use Morse theory on its (free) loop space; while for some purposes it is enough to work with finite-dimensional approximations, it is helpful for some finer aspects of the theory to use models of the ...

If X is a space then L(X) denotes the subspace of C(X) consisting of all Peano (sub)continua. We prove that for n ≥ 3 the space L(R) is homeomorphic to B∞, where B denotes the pseudo-boundary of the Hilbert cube Q. Introduction. For a space X, C(X) denotes the hyperspace of all nonempty subcontinua of X. It is known that for a Peano continuum X without free arcs, C(X) ≈ Q, where Q denotes the H...

Data cube construction is a commonly used operation in data warehouses. Because of the volume of data stored and analyzed in a data warehouse and the amount of computation involved in data cube construction, incremental maintenance of data cube is really effective. To maintain a data cube incrementally, previous methods were mainly for relational databases. In this paper, we employ an extendibl...

Abstract. In this paper, a new building detection method based on density of LiDAR point clouds is proposed. method, trees, vegetation, and any objects that have points in vertical plane or column are removed. the density-based cube utilized to calculate therein. For each point, used determine number neighbouring points. The calculated two cases: 3D 2D space. space, volumetric using cube. all p...

We address the two dominant dilemmas encountered in attempting to demonstrate real-time hyperspectral imaging: how to record a three-dimensional spectral data cube with a conventional two-dimensional detector array and how to most efficiently transmit the spectral data cube through the information bottleneck constituted by the detector’s limited space–bandwidth product. We have demonstrated a n...

We prove new lower bounds for nearest neighbor search in the Hamming cube. Our lower bounds are for randomized, two-sided error, algorithms in Yao’s cell probe model. Our bounds are in the form of a tradeoff among the number of cells, the size of a cell, and the search time. For example, suppose we are searching among n points in the d dimensional cube, we use poly(n, d) cells, each containing ...