13603 search results - page 311 / 2721 » On the Complexity of Computing Treelength |
161
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
147
click to vote
JC
2008
15 years 6 months ago
2008
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
159
click to vote
KES
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. This paper presents a new multi-agent physics-based simulation framework (DISCOVERY), supporting experiments with self-organizing underwater sensor and actuator networks....
180
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Background: Most cellular processes are carried out by multi-protein complexes, groups of proteins that bind together to perform a specific task. Some proteins form stable complex...
174
click to vote
COMPLEX
2009
Springer
16 years 22 days ago
2009
Springer
We introduce transformations from time series data to the domain of complex networks which allow us to characterise the dynamics underlying the time series in terms of topological ...