Sciweavers

406 search results - page 11 / 82
» Fast Increment Registers
Sort
View
CGO
2006
IEEE
14 years 3 months ago
Tailoring Graph-coloring Register Allocation For Runtime Compilation
Just-in-time compilers are invoked during application execution and therefore need to ensure fast compilation times. Consequently, runtime compiler designers are averse to impleme...
Keith D. Cooper, Anshuman Dasgupta
TEC
2008
98views more  TEC 2008»
13 years 9 months ago
A Fast Incremental Hypervolume Algorithm
When hypervolume is used as part of the selection or archiving process in a multiobjective evolutionary algorithm, it is necessary to determine which solutions contribute the least...
Lucas Bradstreet, R. Lyndon While, Luigi Barone
HPCA
2004
IEEE
14 years 10 months ago
Signature Buffer: Bridging Performance Gap between Registers and Caches
Data communications between producer instructions and consumer instructions through memory incur extra delays that degrade processor performance. In this paper, we introduce a new...
Lu Peng, Jih-Kwon Peir, Konrad Lai
ICPR
2004
IEEE
14 years 11 months ago
Building and Registering Parameterized 3D Models of Vessel Trees for Visualization during Intervention
In this paper we address the problem of multimodal registration of coronary vessels by developing a 3D parametrical model of vessel trees from computer tomography data and registe...
Georg Langs, Petia Radeva, David Rotger, Francesc ...
ICML
2008
IEEE
14 years 10 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash