Results 281 to 290 of about 282,631 (306)

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   +1 more source

On Quantum Secure Compressing Pseudorandom Functions

2023
In this paper we characterize all 2n-bit-to-n-bit Pseudorandom Functions (PRFs) constructed with the minimum number of calls to n-bit-to-n-bit PRFs and arbitrary number of linear functions. First, we show that all two-round constructions are either classically insecure, or vulnerable to quantum period-finding attacks.
Ritam Bhaumik, Benoît Cogliati, Jordan Ethan, Ashwin Jha 0001   +3 more
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, Aylin Yener, Ebrahim MolavianJazi, Prithwish Basu, Ananthram Swami, Carl Andersen 0001   +5 more
openaire   +1 more source

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, Jiaping Wang, Li-Yi Wei, Wencheng Wang   +3 more
openaire   +3 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   +1 more source

Match-length functions for data compression

Proceedings of 1994 IEEE International Symposium on Information Theory, 1996
Summary: We investigate uniquely decodable match-length functions (in short, MLF's) in conjunction with Lempel-Ziv (LZ)-type data compression. An MLF of a data string is a function that associates a nonnegative integer with each position of the string. The MLF is used to parse the input string into phrases.
Amnon Gavish, Abraham Lempel
openaire   +1 more source

Zero-Error Distributed Function Compression

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

Oblique Compressible Sears Function

AIAA Journal, 1974
openaire   +2 more sources

High Compression Pressure over the Calf is More Effective than Graduated Compression in Enhancing Venous Pump Function

European Journal of Vascular and Endovascular Surgery, 2012
G Mosti, H Partsch
exaly  

Compression and reconstruction of random microstructures using accelerated lineal path function

Computational Materials Science, 2016
Jan Havelka, Anna Kučerová, Jan Sykora   +2 more
exaly