Searching for authors named "Ioannis Kontoyiannis" – sorted by Relevance.
24 documents found, showing 1 through 10.
Next 10 →
-
Asymptotic Recurrence And Waiting Times For Stationary Processes
- …this paper we investigate the asymptotic behavior of recurrence and waiting times for finite-valued stationary processes, under various mixing conditions. Let X = fX n ; n 2 Zg be a stationary ergodic process on the space of infinite sequences (S…
- Cited by 12 (6 self) – Add To MetaCart
-
Second-Order Analysis of Lossless and Lossy Versions of Lempel-Ziv Codes
- …We present an overview of several recent results (some new and some known) on the asymptotic performance of different variants of the Lempel-Ziv coding algorithm, in both the lossless case and the lossy case. The results are based on the asymptotic behavior of waiting times, following the general me…
- Cited by 2 (1 self) – Add To MetaCart
-
On the Distribution of Recurrence Times and the Exact Asymptotics of Lempel-Ziv Coding
- …; abstract apeared in Proceedings of the 1997 IEEE International Symposium on Information Theory, Ulm, Germany, June-July 1997 Abstract -- Let X = fXn ; n 2 Zg be a finitealphabet, stationary ergodic source distributed according to P and let x = (: : : ; x \Gamma1 ; x 0 ; x 1 ; : : :) denote a re…
- Cited by 1 (1 self) – Add To MetaCart
-
The Asymptotics of Waiting Times Between Stationary Processes, Allowing Distortion
- …this paper is to extend these asymptotic results to W n (D) (see Corollaries 1 through 4, below). Little has been done in this direction: Recently, Yang and Kieffer (1998) showed that (2) holds for W n (D) when AX and A Y are finite sets, with R = R(P 1 ; Q 1 ; D) given as the solution to a variatio…
- Add To MetaCart
-
Arbitrary Source Models and Bayesian Codebooks in Rate-Distortion Theory
- …We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct and converse coding theorems are given for variable-rate codes operating at a xed distortion level, emphasizing: (a) non-asym…
- Cited by 13 (6 self) – Add To MetaCart
-
Second-order properties of lossy likelihoods and the MLE/MDL dichotomy in lossy compression
- …lossy compression…
- Cited by 2 (0 self) – Add To MetaCart
-
The Asymptotics of Waiting Times Between Stationary Processes, Allowing Distortion
- …this paper is to extend these asymptotic results to W n (D) (see Corollaries 1 through 4, below). Little has been done in this direction: Recently, Yang and Kieffer (1998) showed that (2) holds for W n (D) when AX and A Y are finite sets, with R = R(P 1 ; Q 1 ; D) given as the solution to a variatio…
- Cited by 15 (10 self) – Add To MetaCart
-
Source coding, large deviations, and approximate pattern matching
- …Dedicated to the memory of Aaron Wyner, a valued friend and colleague. Abstract—In this review paper, we present a development of parts of rate-distortion theory and pattern-matching algorithms for lossy data compression, centered around a lossy version of the asymptotic equipartition property (AEP)…
- Cited by 12 (8 self) – Add To MetaCart
-
Critical Behavior in Lossy Source Coding
- …|The following critical phenomenon was recently discovered. When a memoryless source is compressed using a variable-length xed-distortion code, the fastest convergence rate of the (pointwise) compression ratio to R(D) is either O( p n) or O(log n). We show it is always O( p n), except for discre…
- Cited by 1 (1 self) – Add To MetaCart
-
An Efficient Recursive Partitioning Algorithm for Classification, Using Wavelets
- …We describe and analyze a new dyadic recursive partitioning algorithm for efficient classification of large two-dimensional data sets, called progressive classification. It uses generic (parametric or nonparametric) classifiers on a low-resolution representation of the data obtained using the discre…
- Cited by 1 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
