Results 181 to 190 of about 4,651 (213)
Some of the next articles are maybe not open access.

Constructing Compression Functions

2021
We have seen that cryptographic hash functions that can process arbitrarily long inputs can be built from fixed-input-length compression functions via the Merkle–Damgard transformation (Chapter 13).
Arno Mittelbach, Marc Fischlin
openaire   +1 more source

On Approximation of Bandlimited Functions with Compressed Sensing

2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2018
The application of Compressed Sensing techniques to bandlimited functions is investigated in this paper. It is shown that under the assumption of sparsity, stable reconstruction of a bandlimited function is possible from finitely many samples, contrary to classical results from signal processing theory.
Huber, Adrian E G, Liu, Shih-Chii
openaire   +1 more source

On the Weak Ideal Compression Functions

2009
In SAC 2006, Liskov introduced the weak ideal compression functions. He proved that a hash construction based on these functions is indifferentiable from the random oracle. In ICALP 2008, Hoch and Shamir applied Liskov's idea and proved the indifferentiability of another hash construction.
Akira Numayama, Keisuke Tanaka
openaire   +1 more source

Effects of Tourniquet Compression on Neuromuscular Function

Clinical Orthopaedics and Related Research, 1999
Neuromuscular function in New Zealand White rabbits was evaluated after thigh tourniquet compression in the directly compressed quadriceps muscles and the distal tibialis anterior by measuring isometric contractile function after supramaximal stimulation of the motor nerve.
L R, Mohler   +3 more
openaire   +2 more sources

Vector Regression Functions for Texture Compression

ACM Transactions on Graphics, 2015
Raster images are the standard format for texture mapping, but they suffer from limited resolution. Vector graphics are resolution-independent but are less general and more difficult to implement on a GPU. We propose a hybrid representation called vector regression functions (VRFs), which compactly approximate any point-sampled image and ...
Ying Song   +3 more
openaire   +3 more sources

Sample-distortion functions for compressed sensing

2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2011
We consider compressed sensing within a stochastic setting, where the signal or image of interest is drawn from a probability distribution that is in some sense compressible. Within this setting we consider some sample-distortion functions for i.i.d. compressible distributions and derive a simple sample distortion lower bound.
Mike E. Davies 0001, Chunli Guo
openaire   +2 more sources

Compressed Suffix Trees with Full Functionality

Theory of Computing Systems, 2007
We introduce new data structures for compressed suffix trees whose size are linear in the text size. The size is measured in bits; thus they occupy only O(n log|A|) bits for a text of length n on an alphabet A. This is a remarkable improvement on current suffix trees which require O(n log n) bits.
openaire   +2 more sources

Interactive Function Compression with Asymmetric Priors

2016 Data Compression Conference (DCC), 2016
We study the interactive compression of an arbitrary function of two discrete sources with zero-error. The information on the joint distribution of the sources available at the two sides is asymmetric, in that one user knows the true distribution, whereas the other user observes a different distribution. This paper considers the minimum worst-case zero-
Basak Guler   +5 more
openaire   +1 more source

Network functional compression

2010
In this thesis, we consider different aspects of the functional compression problem. In functional compression, the computation of a function (or, some functions) of sources is desired at the receiver(s). The rate region of this problem has been considered in the literature under certain restrictive assumptions. In Chapter 2 of this Thesis, we consider
openaire   +1 more source

Zero-Error Distributed Function Compression

2023 IEEE International Symposium on Information Theory (ISIT), 2023
Ruze Zhang, Xuan Guang
openaire   +2 more sources

Home - About - Disclaimer - Privacy