Sciweavers

59 search results - page 9 / 12
» Iterative Lexicographic Path Orders
Sort
View
ESTIMEDIA
2004
Springer
14 years 1 months ago
Data assignment and access scheduling exploration for multi-layer memory architectures
Abstract— This paper presents an exploration framework which performs data assignment and access scheduling exploration for applications given a multilayer memory architecture. O...
Radoslaw Szymanek, Francky Catthoor, Krzysztof Kuc...
STACS
2007
Springer
14 years 2 months ago
Wavelength Management in WDM Rings to Maximize the Number of Connections
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
Ioannis Caragiannis
CIMAGING
2008
123views Hardware» more  CIMAGING 2008»
13 years 9 months ago
Non-homogeneous ICD optimization for targeted reconstruction of volumetric CT
Medical imaging typically requires the reconstruction of a limited region of interest (ROI) to obtain a high resolution image of the anatomy of interest. Although targeted reconst...
Zhou Yu, Jean-Baptiste Thibault, Charles A. Bouman...
SIAMSC
2010
132views more  SIAMSC 2010»
13 years 2 months ago
Some Improvements for the Fast Sweeping Method
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
Stanley Bak, Joyce R. McLaughlin, Daniel Renzi
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 8 days ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla