Sciweavers

644 search results - page 50 / 129
» Decomposition Complexity
Sort
View
79
Voted
COMCOM
2010
112views more  COMCOM 2010»
15 years 22 days ago
Birkhoff-von Neumann switching with statistical traffic profiles
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),...
Jerry Chi-Yuan Chou, Bill Lin
107
Voted
CGF
2004
117views more  CGF 2004»
15 years 14 days ago
Space-Time Hierarchical Radiosity with Clustering and Higher-Order Wavelets
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...
Cyrille Damez, Nicolas Holzschuch, François...
111
Voted
ICIP
2009
IEEE
14 years 10 months ago
Best basis denoising with non-stationary wavelet packets
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 ...
Nizar Ouarti, Gabriel Peyré
117
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Multichannel EEG analysis based on multi-scale multi-information
Functional connectivity has been widely used to reveal the dependencies between signals in complex networks such as neural networks observed from electroencephalogram (EEG) data. ...
Ying Liu, Selin Aviyente
112
Voted
AI
1999
Springer
15 years 9 days ago
Modal Logics, Description Logics and Arithmetic Reasoning
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...
Hans Jürgen Ohlbach, Jana Koehler