#### Filter Results:

- Full text PDF available (54)

#### Publication Year

1974

2018

- This year (1)
- Last 5 years (7)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ming Li, Paul M. B. Vitányi
- Graduate Texts in Computer Science
- 1997

- Rudi Cilibrasi, Paul M. B. Vitányi
- IEEE Transactions on Knowledge and Data…
- 2007

Words and phrases acquire meaning from the way they are used in society, from their relative semantics to other words and phrases. For computers, the equivalent of "society" is "database," and the… (More)

- Rudi Cilibrasi, Paul M. B. Vitányi
- IEEE Transactions on Information Theory
- 2003

We present a new method for clustering based on compression. The method does not use subject-specific features or background knowledge, and works as follows: First, we determine a parameter-free,… (More)

- Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi
- IEEE Transactions on Information Theory
- 2003

A new class of metrics appropriate for measuring effective similarity relations between sequences, say one type of similarity per metric, is studied. We propose a new "normalized information… (More)

- Paul M. B. Vitányi
- IEEE Conference on Computational Complexity
- 2000

In analogy of classical Kolmogorov complexity we develop a theory of the algorithmic information in bits contained in any one of continuously many pure quantum states: quantum Kolmogorov complexity.… (More)

- Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek
- IEEE Trans. Information Theory
- 1998

- Nikolai K. Vereshchagin, Paul M. B. Vitányi
- IEEE Transactions on Information Theory
- 2004

In 1974, Kolmogorov proposed a nonprobabilistic approach to statistics and model selection. Let data be finite binary strings and models be finite sets of binary strings. Consider model classes… (More)

- Rudi Cilibrasi, Paul M. B. Vitányi
- Kolmogorov Complexity and Applications
- 2005

We present a new theory of relative semantics between objects, based on information distance and Kolmogorov complexity. This theory is then applied to construct a method to automatically extract the… (More)

- Péter Gács, John Tromp, Paul M. B. Vitányi
- IEEE Trans. Information Theory
- 2001

While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between an individual data… (More)

- Paul M. B. Vitányi, Ming Li
- IEEE Trans. Information Theory
- 2000

The relationship between the Bayesian approach and the minimum description length approach is established. We sharpen and clarify the general modeling principles minimum description length (MDL) and… (More)