4212 search results - page 31 / 843 » On Compressible Pairings and Their Computation |
189
Voted
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
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...
98
Voted
WISE
2002
Springer
15 years 5 months ago
2002
Springer
Delta compression techniques are commonly used to succinctly represent an updated version of a file with respect to an earlier one. In this paper, we study the use of delta compr...
114
Voted
DASFAA
2006
IEEE
15 years 4 months ago
2006
IEEE
Sharing of common subtrees has been reported useful not only for XML compression but also for main-memory XML query processing. This method compresses subtrees only when they exhib...
102
Voted
CLUSTER
2010
IEEE
14 years 10 months ago
2010
IEEE
All-Pairs, Wavefront, and Makeflow Abstractions Li Yu
108
Voted
RTA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...