Sciweavers

1127 search results - page 22 / 226
» Value Compression for Efficient Computation
Sort
View
GCC
2005
Springer
15 years 3 months ago
An Efficient Network Information Model Using NWS for Grid Computing Environments
Grid computing technologies enable large-scale aggregation and sharing of resources via wide-area networks focused on sharing computational, data, and other resources to form gener...
Chao-Tung Yang, Po-Chi Shih, Sung-Yi Chen, Wen-Chu...
COCOON
2008
Springer
14 years 11 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
DAS
1998
Springer
15 years 1 months ago
Group 4 Compressed Document Matching
Numerous approaches, including textual, structural and featural, to detecting duplicate documents have been investigated. Considering document images are usually stored and transm...
Dar-Shyang Lee, Jonathan J. Hull
83
Voted
VLDB
1999
ACM
159views Database» more  VLDB 1999»
15 years 1 months ago
Aggregation Algorithms for Very Large Compressed Data Warehouses
Many efficient algorithms to compute multidimensional aggregation and Cube for relational OLAP have been developed. However, to our knowledge, there is nothing to date in the lite...
Jianzhong Li, Doron Rotem, Jaideep Srivastava
WWW
2008
ACM
14 years 9 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou