Sciweavers

383 search results - page 15 / 77
» OLAP Dimension Constraints
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 8 days ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
CAD
2011
Springer
14 years 6 months ago
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
Ramanathan Muthuganapathy, Gershon Elber, Gill Bar...
PVLDB
2008
126views more  PVLDB 2008»
14 years 11 months ago
Dwarfs in the rearview mirror: how big are they really?
Online-Analytical Processing (OLAP) has been a field of competing technologies for the past ten years. One of the still unsolved challenges of OLAP is how to provide quick respons...
Jens Dittrich, Lukas Blunschi, Marcos Antonio Vaz ...
SMI
2005
IEEE
117views Image Analysis» more  SMI 2005»
15 years 5 months ago
Contouring 1- and 2-Manifolds in Arbitrary Dimensions
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim
FOCS
1990
IEEE
15 years 3 months ago
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
Noga Alon, Nimrod Megiddo