62 citations · 63 across the 4 of their papers we have counts for
Showing 2003Show all
3 papers · 1 filter
cs.CV2003★ 62 cited
Clustering by compression
Rudi Cilibrasi, Paul Vitanyi
We present a new method for clustering based on compression. The method doesn't use subject-specific features or background knowledge, and works as follows: First, we determine a u…
cs.CC2003
Individual Communication Complexity
Harry Buhrman, Hartmut Klauck, Nikolai Vereshchagin +1
We initiate the theory of communication complexity of individual inputs held by the agents, rather than worst-case or average-case. We consider total, partial, and partially correc…
nlin.CD2003★ 1 cited
Algorithmic Chaos
Paul Vitanyi
Many physical theories like chaos theory are fundamentally concerned with the conceptual tension between determinism and randomness. Kolmogorov complexity can express randomness in…