4747 search results - page 348 / 950 » Shuffle Memory System |
135
Voted
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
162
Voted
JSC
2011
14 years 8 months ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
192
Voted
EMMCVPR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...
132
click to vote
FAST
2008
15 years 7 months ago
2008
Operating system memory managers fail to consider the population of read versus write pages in the buffer pool or outstanding I/O requests when writing dirty pages to disk or netw...
142
click to vote
SC
2009
ACM
15 years 12 months ago
2009
ACM
Continuous evolution in process technology brings energyefficiency and reliability challenges, which are harder for memory system designs since chip multiprocessors demand high ba...