Sciweavers

64 search results - page 1 / 13
» Efficient Computation in Groups Via Compression
Sort
View
WWW
2008
ACM
13 years 5 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
ICDE
2007
IEEE
151views Database» more  ICDE 2007»
14 years 7 months ago
Computing Compressed Multidimensional Skyline Cubes Efficiently
Recently, the skyline computation and analysis have been extended from one single full space to multidimensional subspaces, which can lead to valuable insights in some application...
Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Haixun Wang
DAS
1998
Springer
13 years 10 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
ASIACRYPT
2001
Springer
13 years 9 months ago
An Efficient Implementation of Braid Groups
We implement various computations in the braid groups via practically efficient and theoretically optimized algorithms whose pseudo-codes are provided. The performance of an actual...
Jae Choon Cha, Ki Hyoung Ko, Sangjin Lee, Jae Woo ...