2446 search results - page 74 / 490 » Choiceless Polynomial Time |
ICA
2004
Springer
14 years 1 months ago
2004
Springer
We address the blind source separation (BSS) problem for the convolutive mixing case. Second-order statistical methods are employed assuming the source signals are non-stationary a...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
COCO
1993
Springer
13 years 11 months ago
1993
Springer
Recently Lutz [14,15] introduced a polynomial time bounded version of Lebesgue measure. He and others (see e.g. [11,13,14,15,16,17,18,20]) used this concept to investigate the quan...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
There are two main classes of decoding algorithms for "compressed sensing," those which run time time polynomial in the signal length and those which use sublinear resou...