Sciweavers

4355 search results - page 35 / 871
» Increasing Kolmogorov Complexity
Sort
View
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
14 years 22 days ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
FINTAL
2006
14 years 9 days ago
Analysis of EU Languages Through Text Compression
In this article, we are studying the differences between the European languages using statistical and unsupervised methods. The analysis is conducted in different levels of languag...
Kimmo Kettunen, Markus Sadeniemi, Tiina Lindh-Knuu...
CIKM
2008
Springer
13 years 10 months ago
Information shared by many objects
If Kolmogorov complexity [25] measures information in one object and Information Distance [4, 23, 24, 42] measures information shared by two objects, how do we measure information...
Chong Long, Xiaoyan Zhu, Ming Li, Bin Ma
SODA
2003
ACM
142views Algorithms» more  SODA 2003»
13 years 10 months ago
The similarity metric
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vit&...
APAL
2008
69views more  APAL 2008»
13 years 8 months ago
Lowness properties and approximations of the jump
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...
Santiago Figueira, André Nies, Frank Stepha...