7380 search results - page 180 / 1476 » time 2008 |
169
click to vote
CC
2008
Springer
15 years 6 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
164
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
131
click to vote
MCS
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we propose a computationally effective approach to detect multiple structural breaks in the mean occurring at unknown dates. We present a non-parametric approach th...
172
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
164
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
To combine the high power efficiency of Continuous Phase Modulation (CPM) with either high spectral efficiency or enhanced performance in low Signal to Noise conditions, some auth...