701 search results - page 46 / 141 » Kolmogorov complexity in perspective |
APAL
2008
13 years 7 months ago
2008
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...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
TKDE
2010
13 years 6 months ago
2010
—Long time-series datasets are common in many domains, especially scientific domains. Applications in these fields often require comparing trajectories using similarity measure...
LREC
2010
13 years 9 months ago
2010
Evaluating complex Natural Language Processing (NLP) systems can prove extremely difficult. In many cases, the best one can do is to evaluate these systems indirectly, by looking ...
IEEECIT
2006
IEEE
14 years 1 months ago
2006
IEEE
Although traditional software metrics have widely been applied to practical software projects, they have insufficient abilities to measure a large-scale system’s complexity at h...