Sciweavers

Share
25 search results - page 1 / 5
» On the q-Analogue of the Sum of Cubes
Sort
View
COMBINATORICS
2004
56views more  COMBINATORICS 2004»
9 years 11 months ago
On the q-Analogue of the Sum of Cubes
S. Ole Warnaar
EACL
2009
ACL Anthology
11 years 13 days ago
Cube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
Kevin Gimpel, Noah A. Smith
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
11 years 1 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...
DKE
2000
75views more  DKE 2000»
9 years 11 months ago
Range queries in dynamic OLAP data cubes
A range query applies an aggregation operation (e.g., SUM) over all selected cells of an OLAP data cube where the selection is speci
Weifa Liang, Hui Wang, Maria E. Orlowska
COMBINATORICS
2004
96views more  COMBINATORICS 2004»
9 years 11 months ago
A Combinatorial Proof of the Sum of q-Cubes
We give a combinatorial proof of a q-analogue of the classical formula for the sum of cubes.
Kristina C. Garrett, Kristen Hummel
books