4797 search results - page 58 / 960 » The complexity of partition tasks |
DAM
2008
13 years 9 months ago
2008
In this short paper we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation...
DATE
2004
IEEE
14 years 18 days ago
2004
IEEE
Many high-end DSP processors employ both multiple memory banks and heterogeneous register files to improve performance and power consumption. The complexity of such architectures ...
DLOG
2007
13 years 11 months ago
2007
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
ICIP
2005
IEEE
14 years 10 months ago
2005
IEEE
A new approach to Variable Size Block Matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then...
ADC
2008
Springer
14 years 3 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...