نتایج جستجو برای: space time cube
تعداد نتایج: 2256432 فیلتر نتایج به سال:
This paper proposes a simple and efficient technique to generate uniformly random points in a tetrahedron. The technique generates random points in a cube, and folds the cube into the barycentric space of the tetrahedron in a way that preserves uniformity.
The Iceberg-Cube problem restricts the computation of the data cube to only those group-by partitions satisfying a minimum threshold condition defined on a specified measure. In this paper, we implement the Bottom-Up Computation (BUC) algorithm for computing Iceberg cubes and conduct a sensitivity analysis of BUC with respect to the probability density function of the data. The distributions un...
Imaginary cubes are three dimensional objects which have square silhouette projections in three orthogonal ways just as a cube has. In this paper, we study imaginary cubes and present assembly puzzles based on them. We show that there are 16 equivalence classes of minimal convex imaginary cubes, among whose representatives are a hexagonal bipyramid imaginary cube and a triangular antiprism imag...
Unilateral neglect is a disorder involving difficulty in attending to the side of space contralesional to brain injury. Two recent experiments have shown that task-irrelevant background motion reduces neglect on line bisection tasks; however, task-relevant motion has not been assessed. We investigated the effect of task-relevant object motion on left neglect using a moving cube presented on a c...
Eye movement recordings produce large quantities of spatiotemporal data, and are more and more frequently used as an aid to gain further insight into human thinking in usability studies in GIScience domain among others. After reviewing some common visualization methods for eye movement data, the limitations of these methods are discussed. This paper proposes an approach that enables the use of ...
Multivariable spatio-temporal data is used to describe the change of characteristics of objects with time and location, and the change in location of objects is also considered. To analysis of this kind of data, data visualization is one of the effective techniques. This paper presents two new visualization approaches, the Multivariable-Time-Cube (MTC) and Parallel Coordinate Plot-Time-Cube (PT...
The c-approximate Near Neighbor problem in high dimensional spaces has been mainly addressed by Locality Sensitive Hashing (LSH), which offers polynomial dependence on the dimension, query time sublinear in the size of the dataset, and subquadratic space requirement. For practical applications, linear space is typically imperative. Most previous work in the linear space regime focuses on the ca...
Basing on the original Cube attack, this paper proposes an improved method of Cube attack on stream ciphers, which makes improvement on the pre-processing phase of the original attack. The new method can induce maxterms of higher-order from those of lower-order by the trade-off between time and space, thus recovering more key bits and reducing the search complexity on higher-dimension. In this ...
This paper presents optimal setup procedures for cubeconnected networks. The setup patterns include paths, transpositions, cycles, and one-pass permutations. For an N-input cube-connected network, the procedure for paths requires O(log2 N ) steps, and O(N) space, that for transpositions and cycles requires O(N) steps, and O(N) space, and that for permutations takes O(N log2 N ) steps, and O(N) ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید