4539 search results - page 430 / 908 » Approaches to Compute Workflow Complexity |
160
Voted
ISVC
2007
Springer
16 years 29 days ago
2007
Springer
This paper presents a method to reduce time complexity of the computation of higher–order tensor lines. The method can be applied to higher–order tensors and the spherical harm...
174
click to vote
KIVS
2007
Springer
16 years 29 days ago
2007
Springer
This paper presents several results on dynamic OFDMA systems. It addresses especially the algorithmic complexity involved with several resource allocation approaches, sub-optimal h...
162
click to vote
LCPC
2007
Springer
16 years 29 days ago
2007
Springer
As modern supercomputing systems reach the peta-flop performance range, they grow in both size and complexity. This makes them increasingly vulnerable to failures from a variety o...
195
click to vote
MIRAGE
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of an alpha overlay shadow model. Previou...
162
click to vote
WG
2007
Springer
16 years 28 days ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...