Sciweavers

1675 search results - page 231 / 335
» Implementing Data Cubes Efficiently
Sort
View
DOLAP
2005
ACM
14 years 22 hour ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
13 years 11 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
WSCG
2004
161views more  WSCG 2004»
13 years 11 months ago
Rendering Techniques for Hardware-Accelerated Image-Based CSG
Image-based CSG rendering algorithms for standard graphics hardware rely on multipass rendering that includes reading and writing large amounts of pixel data from and to the frame...
Florian Kirsch, Jürgen Döllner
VCIP
2000
134views Communications» more  VCIP 2000»
13 years 11 months ago
High-level syntax for H.26L: first results
This paper introduces some preliminary results of the standardization process of ITU-T's H.26L project. This forthcoming video coding standard will not only significantly imp...
Stephan Wenger
EUROPAR
2010
Springer
13 years 11 months ago
Generators-of-Generators Library with Optimization Capabilities in Fortress
Abstract. To resolve difficulties in parallel programming, a large number of studies are conducted on parallel skeletons and optimization theorems over skeleton programs. However, ...
Kento Emoto, Zhenjiang Hu, Kazuhiko Kakehi, Kimino...