Sciweavers

142 search results - page 9 / 29
» Generalized Fibonacci Cubes
Sort
View
ECCC
2007
96views more  ECCC 2007»
13 years 9 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky
ICDT
2001
ACM
147views Database» more  ICDT 2001»
14 years 2 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
TPDS
1998
129views more  TPDS 1998»
13 years 9 months ago
The Offset Cube: A Three-Dimensional Multicomputer Network Topology Using Through-Wafer Optics
—Three-dimensional packaging technologies are critical for enabling ultra-compact, massively parallel processors (MPPs) for embedded applications. Through-wafer optical interconn...
W. Stephen Lacy, José Cruz-Rivera, D. Scott...
DOLAP
2006
ACM
14 years 3 months ago
Enhanced mining of association rules from data cubes
On-line analytical processing (OLAP) provides tools to explore and navigate into data cubes in order to extract interesting information. Nevertheless, OLAP is not capable of expla...
Riadh Ben Messaoud, Sabine Loudcher Rabaséd...
DOLAP
2000
ACM
14 years 2 months ago
Comparing Nested GPSJ Queries in Multidimensional Databases
A multidimensional database can be seen as a collection of multidimensional cubes, from which information is usually extracted by aggregation; aggregated data can be calculated ei...
Matteo Golfarelli, Stefano Rizzi