Sciweavers

644 search results - page 57 / 129
» Decomposition Complexity
Sort
View
90
Voted
DAC
1996
ACM
15 years 4 months ago
A Description Language for Design Process Management
A language for defining design discipline characteristics is proesign discipline characteristics such as abstraction levels, design object classifications and decompositions, desi...
Peter R. Sutton, Stephen W. Director
103
Voted
DICTA
2003
15 years 2 months ago
Shift-invariance in the Discrete Wavelet Transform
In this paper we review a number of approaches to reducing, or removing, the problem of shift variance in the discrete wavelet transform (DWT). We describe a generalization of the ...
Andrew P. Bradley
TJS
2008
78views more  TJS 2008»
15 years 16 days ago
A performance study of multiprocessor task scheduling algorithms
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
Shiyuan Jin, Guy A. Schiavone, Damla Turgut
97
Voted
PVLDB
2010
189views more  PVLDB 2010»
14 years 11 months ago
Slicing Long-Running Queries
The ability to decompose a complex, long-running query into simpler queries that produce the same result is useful for many scenarios, such as admission control, resource manageme...
Nicolas Bruno, Vivek R. Narasayya, Ravishankar Ram...
ISSPIT
2010
14 years 7 months ago
On the advantages of subspace tracking for temporal updating
When doing parameter estimation, ESPRIT is an often used algorithm. As input, ESPRIT needs the eigenvectors of the signal subspace. These can be generated by an eigenvalue decompos...
Matthias Lechtenberg, Jürgen Götze