Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 10 of 10 for “"Universal compression"”.

  1. Universal Compression of Piecewise iid Sources

    … distribution P for some (unknown) 2 . We seek a universal joint distribution Q : An ! [0 1] which is `not much worse' than any potential `true' distribution P 2 fPtheta j 2 g, where performance is measured by coding redundancy log P (x) Q(x) , x 2 An. The study of coding redundancy is motivated …

    anu Repository record for Universal Compression of Piecewise iid Sources (opens in a new tab)

  2. Network compression via network memory: fundamental performance limits

    … understand the fundamental performance limits of universal compression of this massive data at the packet level using universal compression just above layer 3 of the network when the intermediate network nodes are enabled with the capability of memorizing the previous traffic. Universality of …

    gatech Repository record for Network compression via network memory: fundamental performance limits (opens in a new tab)

  3. Characterizing the redundancy of universal source coding for finite-length sequences

    … is the average redundancy resulting from the universal compression of a single finite-length sequence from an unknown source. In the universal compression of a source with d unknown parameters, Rissanen demonstrated that the expected redundancy for regular codes is asymptotically d/2 log n + …

    gatech Repository record for Characterizing the redundancy of universal source coding for finite-length sequences (opens in a new tab)

  4. Universal graph compression : stochastic block models

    … such data, this thesis investigates lossless compression of data appearing in the form of a labeled graph. In particular, we consider a widely used random graph model, stochastic block model (SBM), which captures the clustering effects in social networks. An information-theoretic universal …

    ubc Repository record for Universal graph compression : stochastic block models (opens in a new tab) Download PDF for Universal graph compression : stochastic block models (opens in a new tab)

  5. On the Compression of Unknown Sources

    … the class of \iid or Markov distributions. While universal compression of finite support distributions has been well studied, we look into more involved classes---in particular, distributions over countable supports, as well as the relations between compression and estimation in Markov setups …

    hawaii Repository record for On the Compression of Unknown Sources (opens in a new tab)

  6. Information Theory With Large Alphabets And Source Coding Error Exponents

    … The second problem addressed concerns compression of sources with large alphabets. We first characterize for which alphabet growth rates is universal compression possible. We then study the permitted alphabet growth-rate in the non-universal case in which the goal is to compress a …

    cornell Repository record for Information Theory With Large Alphabets And Source Coding Error Exponents (opens in a new tab)

  7. An investigation of the effect of dynamic and static loading to geosynthetic reinforced pavements overlying a soft subgrade

    … steel plate on the two layer system using a Universal Compression Machine. Static loading was applied at a rate of 1.2 mm/min. Dynamic sinusoidal load wave was applied with a 4 kN seating load that was linearly increased with an incremental load of 4 kN for every 8 cycles at a frequency of …

    cape-town Repository record for An investigation of the effect of dynamic and static loading to geosynthetic reinforced pavements overlying a soft subgrade (opens in a new tab)

  8. Theoretical Modeling and Practical Operation of Channels with Output Memory

    … with a length-n sample. Combining the results of universal compression with the Aldous coupling arguments, we obtain sufficient conditions on the length-n sample (even for slow mixing models) to identify when naive (i) estimates of the model parameters are accurate ; (ii) estimates related to the …

    hawaii Repository record for Theoretical Modeling and Practical Operation of Channels with Output Memory (opens in a new tab)

  9. Markov Processes: Estimation and Sampling in Undersampled Regime

    … than just consistency. Combining results in universal compression with Aldous' coupling arguments, we obtain su cient conditions on the length-n sample (even for slow mixing models) to identify when naive (i) estimates of the model parameters and (ii) estimates related to the stationary …

    hawaii Repository record for Markov Processes: Estimation and Sampling in Undersampled Regime (opens in a new tab)

  10. NEW PARADIGMS IN SOURCE CODING AND CHANNEL CODING

    The two pillars of information theory, data compression and channel coding, are often considered as having reached maturity a long time ago. Our research brings fresh perspectives to both these areas by challenging long-standing assumptions and introducing new frameworks. The Shannon entropy and …

    cornell Repository record for NEW PARADIGMS IN SOURCE CODING AND CHANNEL CODING (opens in a new tab)