activity
19982009
most citedClustering by compression

62 citations · 130 across the 17 of their papers we have counts for

collaborators
Showing 2006Show all

6 papers · 1 filter

cs.IT2006

Tales of Huffman

Paul M. B. Vitanyi, Zvi Lotker

We study the new problem of Huffman-like codes subject to individual restrictions on the code-word lengths of a subset of the source words. These are prefix codes with minimal expe…

q-bio.TO2006

Clustering fetal heart rate tracings by compression

C. Costa Santos, J. Bernardes, P. Vitanyi +1

Fetal heart rate (FHR) monitoring, before and during labor, is a very important medical practice in the detection of fetuses in danger. We clustered FHR tracings by compression in…

cs.DC2006

About the Lifespan of Peer to Peer Networks

R. Cilibrasi, Z. Lotker, A. Navarra +2

We analyze the ability of peer to peer networks to deliver a complete file among the peers. Early on we motivate a broad generalization of network behavior organizing it into one o…

cs.LG2006

Approximation of the Two-Part MDL Code

Pieter Adriaans, Paul Vitanyi

Approximation of the optimal two-part MDL code for given data, through successive monotonically length-decreasing two-part MDL codes, has the following properties: (i) computation…

cs.IT20063 cited

Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising

Steven de Rooij, Paul Vitanyi

Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel…

cs.CV200631 cited

Similarity of Objects and the Meaning of Words

Rudi Cilibrasi, Paul Vitanyi

We survey the emerging area of compression-based, parameter-free, similarity distance measures useful in data-mining, pattern recognition, learning and automatic semantics extracti…