2609 search results - page 112 / 522 » Optimizing for parallelism and data locality |
213
click to vote
CASES
2003
ACM
16 years 2 days ago
2003
ACM
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
301
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
188
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Most application level fault tolerance schemes in literature are non-adaptive in the sense that the fault tolerance schemes incorporated in applications are usually designed witho...
171
click to vote
ICDAR
2003
IEEE
16 years 3 days ago
2003
IEEE
In this paper we propose a parallel approach for the Kmeans Vector Quantization (VQ) algorithm used in a twostage Hidden Markov Model (HMM)-based system for recognizing handwritte...
170
click to vote
PDCN
2004
15 years 8 months ago
2004
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...