Sciweavers

4212 search results - page 73 / 843
» On Compressible Pairings and Their Computation
Sort
View
DAC
2006
ACM
15 years 6 months ago
High-performance operating system controlled memory compression
This article describes a new software-based on-line memory compression algorithm for embedded systems and presents a method of adaptively managing the uncompressed and compressed ...
Lei Yang, Haris Lekatsas, Robert P. Dick
WWW
2008
ACM
15 years 15 days 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
RECOMB
2003
Springer
16 years 28 days ago
Phylogenetically and spatially conserved word pairs associated with gene expression changes in yeasts
Background: Transcriptional regulation in eukaryotes often involves multiple transcription factors binding to the same transcription control region, and to understand the regulato...
Derek Y. Chiang, Alan M. Moses, Manolis Kamvysseli...
IEEEPACT
2002
IEEE
15 years 5 months ago
Workload Design: Selecting Representative Program-Input Pairs
Having a representative workload of the target domain of a microprocessor is extremely important throughout its design. The composition of a workload involves two issues: (i) whic...
Lieven Eeckhout, Hans Vandierendonck, Koenraad De ...
PAIRING
2010
Springer
155views Cryptology» more  PAIRING 2010»
14 years 10 months ago
Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches
Abstract. This paper describes a new method in pairing-based signature schemes for identifying the invalid digital signatures in a batch after batch verification has failed. The me...
Brian J. Matt