Sciweavers

3134 search results - page 67 / 627
» Computing full disjunctions
Sort
View
ICDE
2004
IEEE
125views Database» more  ICDE 2004»
14 years 11 months ago
Range CUBE: Efficient Cube Computation by Exploiting Data Correlation
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
Ying Feng, Divyakant Agrawal, Amr El Abbadi, Ahmed...
PDP
2006
IEEE
14 years 4 months ago
An Experimental Validation of the PRO Model for Parallel and Distributed Computation
— The Parallel Resource-Optimal (PRO) computation model was introduced by Gebremedhin et al. [2002] as a framework for the design and analysis of efficient parallel algorithms. ...
Mohamed Essaïdi, Jens Gustedt
HOTI
2005
IEEE
14 years 3 months ago
Challenges in Building a Flat-Bandwidth Memory Hierarchy for a Large-Scale Computer with Proximity Communication
Memory systems for conventional large-scale computers provide only limited bytes/s of data bandwidth when compared to their flop/s of instruction execution rate. The resulting bo...
Robert J. Drost, Craig Forrest, Bruce Guenin, Ron ...
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
14 years 1 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 10 months ago
Extending scientific computing system with structural quantum programming capabilities
We present the basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming langua...
P. Gawron, Jerzy Klamka, J. A. Miszczak, Ryszard W...