5244 search results - page 249 / 1049 » Structural Complexity of AvgBPP |
123
click to vote
APAL
2010
15 years 5 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
115
click to vote
BMCBI
2006
15 years 5 months ago
2006
Background: Today, there is a growing need in bioinformatics to combine available software tools into chains, thus building complex applications from existing single-task tools. T...
114
click to vote
IPL
2008
15 years 5 months ago
2008
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
157
click to vote
IPL
2006
15 years 5 months ago
2006
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
146
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
nteractions. Moreover, at a certain level of abstraction, one can also find many common features between complex structures in very different fields. Francis Heylighen, mentor of t...