Sciweavers

4212 search results - page 80 / 843
» On Compressible Pairings and Their Computation
Sort
View
IPM
2011
71views more  IPM 2011»
14 years 4 months ago
Improving semistatic compression via phrase-based modeling
In recent years, new semistatic word-based byte-oriented text compressors, such as Tagged Huffman and those based on Dense Codes, have shown that it is possible to perform fast d...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...
GRAPHITE
2006
ACM
15 years 6 months ago
Two-stage compression for fast volume rendering of time-varying scalar data
This paper presents a two-stage compression method for accelerating GPU-based volume rendering of time-varying scalar data. Our method aims at reducing transfer time by compressin...
Daisuke Nagayasu, Fumihiko Ino, Kenichi Hagihara
ICASSP
2011
IEEE
14 years 4 months ago
Multi-channel EEG compression based on matrix and tensor decompositions
Compression schemes for EEG signals are developed based on matrix and tensor decomposition. Various ways to arrange EEG signals into matrices and tensors are explored, and several...
Justin Dauwels, K. Srinivasan, M. Ramasubba Reddy,...
TRUST
2010
Springer
15 years 5 months ago
A Pairing-Based DAA Scheme Further Reducing TPM Resources
Direct Anonymous Attestation (DAA) is an anonymous signature scheme designed for anonymous attestation of a Trusted Platform Module (TPM) while preserving the privacy of the devic...
Ernie Brickell, Jiangtao Li
CORR
2008
Springer
113views Education» more  CORR 2008»
15 years 21 days ago
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
Paul Tarau