4797 search results - page 205 / 960 » The complexity of partition tasks |
152
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper focuses on parallelization of the classic static timing analysis (STA) algorithm for verifying timing characteristics of digital integrated circuits. Given ever-increasi...
270
click to vote
ICDE
1997
IEEE
16 years 7 months ago
1997
IEEE
The need to transform data between heterogeneous databases arises from a number of critical tasks in data management. These tasks are complicated by schema evolution in the underl...
170
click to vote
JSSPP
2010
Springer
15 years 4 months ago
2010
Springer
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
155
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
163
click to vote
ISMIR
2003
Springer
15 years 11 months ago
2003
Springer
A technique for harmonic analysis is presented that partitions a piece of music into contiguous regions and labels each with the key, mode, and functional chord, e.g. tonic, domin...