Sciweavers

1198 search results - page 132 / 240
» Compiling for EDGE Architectures
Sort
View
DAC
1989
ACM
15 years 10 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong
VIP
2000
15 years 7 months ago
Automatic Extraction of Lung Boundaries by a Knowledge-Based Method
The aim of this paper is to develop accurate and reliable methods for automated detection of the edges of the lung by a knowledge-based approach. First, the system initialises the...
Mira Park, Laurence S. Wilson, Jesse S. Jin
CGO
2010
IEEE
16 years 1 months ago
Dynamic interpretation for dynamic scripting languages
Dynamic scripting languages offer programmers increased flexibility by allowing properties of programs to be defined at run-time. Typically, program execution begins with an int...
Kevin Williams, Jason McCandless, David Gregg
CASES
2009
ACM
16 years 27 days ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...
CC
2003
Springer
114views System Software» more  CC 2003»
15 years 11 months ago
Combined Code Motion and Register Allocation Using the Value State Dependence Graph
We define the Value State Dependence Graph (VSDG). The VSDG is a form of the Value Dependence Graph (VDG) extended by the addition of state dependence edges to model sequentialise...
Neil Johnson, Alan Mycroft