644 search results - page 50 / 129 » Decomposition Complexity |
COMCOM
2010
15 years 2 months ago
2010
Offline scheduling is attractive when the traffic profile is known a priori since the complexity of online scheduling is largely removed. Given any admissible rate matrix = (ij),...
121
Voted
CGF
2004
15 years 2 months ago
2004
We address in this paper the issue of computing diffuse global illumination solutions for animation sequences. The principal difficulties lie in the computational complexity of gl...
124
Voted
ICIP
2009
IEEE
15 years 10 days ago
2009
IEEE
This article introduces a best basis search algorithm in a nonstationary (NS) wavelet packets dictionary. It computes an optimized labeled quad-tree that indexes the filters used ...
133
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Functional connectivity has been widely used to reveal the dependencies between signals in complex networks such as neural networks observed from electroencephalogram (EEG) data. ...
132
Voted
AI
1999
Springer
15 years 2 months ago
1999
Springer
Forthcoming in the Journal of Aritificial Intelligence We introduce mathematical programming and atomic decomposition as the basic modal (T-Box) inference techniques for a large c...