搜索结果: 1-15 共查到“数学 Compression”相关记录19条 . 查询时间(0.018 秒)
Data compression and definability of types in stable and dependent formulas
Data compression formulas
2015/9/28
Data compression and definability of types in stable and dependent formulas.
Compression schemes, stable definable families, and o-minimal structures
Compression schemes stable definable families o-minimal structures
2015/9/28
We show that any family of sets uniformly definable in an ominimal
structure has an extended compression scheme of size equal
to the number of parameters in the defining formula.
Compression of the electron repulsion integral tensor in tensor hypercontraction format with cubic scaling cost
electron repulsion integral tensor tensor hypercontraction format cubic scaling cost
2015/7/14
Electron repulsion integral tensor has ubiquitous applications in quantum chemistry calculations. In this work, we propose an algorithm which compresses the electron repulsion tensor into the tensor h...
Acyclic edge-coloring using entropy compression
Acyclic edge-coloring entropy compression Combinatorics
2012/6/29
An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta has an acyclic edge-co...
Lossless Linear Compression of Data with Minimal Dimension in Linear Minimum Variance Estimation
LMV estimation lossless compression linear transformation singular value
2011/11/11
Consider a Linear Minimum Variance (LMV) estimation problem where the linear transformation of data is needed to compress dimension of observation data without loss of performance. A necessary and su±...
A New Method of Data Compression in Multisensor Estimation Fusion
Parameter estimation data compression Bayesian decision
2011/11/7
Consider the decentralized estimation of an unknown parameter by bandwidth constrained sensor network with a fusion center. Local sensors make observations which are linearly scaled versions of these ...
The Preimage Security of Double-Block-Length Compression Functions
Hash Function Preimage Resistance Block Cipher Beyond Birthday Bound Foundations
2012/12/4
We present new techniques for deriving preimage resistance bounds for block cipher based double-block-length, double-call hash functions. We give improved bounds on the preimage security of the three ...
A New Technique for Text Data Compression
Coding Data Compression Binary system Ternary System Golden Ratio
2011/3/3
In this paper we use ternary representation of numbers for compressing text data. We
use a binary map for ternary digits and introduce a way to use the binary 11-pair, which has never been use for co...
Compression-induced failure of electro-active polymeric thin films
actuators electroactive polymers (EAP) compression
2011/1/19
The insurgence of compression induces wrinkling in actuation devices based on EAPs thin films leading to a sudden decrease of performances up to fail-ure.
A Coder-Decoder model for use in Lossless Data Compression
A Coder-Decoder model Data Compression
2010/11/24
This article describes a technique of using a trigonometric function and combinatorial calculations to code or transform any finite sequence of binary numbers (0s and 1s) of any length to a unique set...
In the paper, a theoretical work is done for investigating effects of splitting data sequence into packs of data set. We proved that a partitioning of data sequence is possible to find such that the e...
Lossy compression of discrete sources via Viterbi algorithm
Lossy compression discrete sources Viterbi algorithm
2010/11/22
We present a new lossy compressor for discrete-valued sources. For coding a sequence $x^n$, the encoder starts by assigning a certain cost to each possible reconstruction sequence. It then finds the ...
Extending pseudo-Anosov maps to compression bodies
Extending pseudo-Anosov maps compression bodies
2010/11/8
We show that a pseudo-Anosov map on a boundary component of an irreducible 3-manifold has a power that partially extends to the interior if and only if its (un)stable lamination is a projective limit...
For storing a word or the whole text segment, we need a huge storage space. Typically a character requires 1 Byte for storing it in memory. Compression of the memory is very important for data managem...
Hilbert space compression under direct limits and certain group extensions
Hilbert space compression direct limits certain group extensions
2010/12/3
We find bounds on the Hilbert space compression of the limit of a directed metric system of groups. We also give estimates on the Hilbert space compression of group extensions of a group H by a a word...