315 search results - page 9 / 63 » Improving Performance by Branch Reordering |
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
With the increasing gap between processor speed and memory latency, the performance of data-dominated programs are becoming more reliant on fast data access, which can be improved...
IEEEPACT
2006
IEEE
14 years 1 months ago
2006
IEEE
In SMT processors, the complex interplay between private and shared datapath resources needs to be considered in order to realize the full performance potential. In this paper, we...
COLING
2010
13 years 2 months ago
2010
We present a constituent parsing-based reordering technique that improves the performance of the state-of-the-art English-to-Japanese phrase translation system that includes disto...
EMNLP
2011
12 years 7 months ago
2011
We propose a simple training regime that can improve the extrinsic performance of a parser, given only a corpus of sentences and a way to automatically evaluate the extrinsic qual...
ISCA
2007
IEEE
14 years 1 months ago
2007
IEEE
Indirect branches have become increasingly common in modular programs written in modern object-oriented languages and virtualmachine based runtime systems. Unfortunately, the pred...