701 search results - page 6 / 141 » Kolmogorov complexity in perspective |
MFCS
2009
Springer
14 years 3 days ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
NIPS
2007
13 years 9 months ago
2007
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
COCO
2004
Springer
14 years 28 days ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
ICONIP
2008
13 years 9 months ago
2008
In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kol...
MFCS
1997
Springer
13 years 11 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...