Sciweavers

45 search results - page 5 / 9
» Compressed Counting
Sort
View
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 9 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
VLDB
2001
ACM
139views Database» more  VLDB 2001»
14 years 2 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
DCC
2010
IEEE
14 years 4 months ago
Lossless Data Compression via Substring Enumeration
We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order...
Danny Dubé, Vincent Beaudoin
ICIP
2004
IEEE
14 years 11 months ago
A novel compressed domain shot segmentation algorithm on H.264/AVC
This paper presents a novel shot segmentation algorithm on the H.264/AVC video, which operates in the compressed domain. First, the algorithm exploits the intra prediction mode hi...
Yang Liu, Weiqiang Wang, Wen Gao, Wei Zeng
SIGMETRICS
2011
ACM
198views Hardware» more  SIGMETRICS 2011»
13 years 4 months ago
Memory Trace Compression and Replay for SPMD Systems using Extended PRSDs?
Concurrency levels in large-scale supercomputers are rising exponentially, and shared-memory nodes with hundreds of cores and non-uniform memory access latencies are expected with...
Sandeep Budanur, Frank Mueller, Todd Gamblin