Sciweavers

3645 search results - page 488 / 729
» Implementing mapping composition
Sort
View
CODES
1994
IEEE
15 years 11 months ago
Towards a declarative framework for hardware-software codesign
We present an experimental framework for mapping declarative programs, written in a language known as Ruby, into various combinations of hardware and software. Strategies for para...
Wayne Luk, Teddy Wu
ICRA
1993
IEEE
142views Robotics» more  ICRA 1993»
15 years 11 months ago
Avoiding the Past: A Simple but Effective Strategy for Reactive Navigation
An issue central to the navigation problem is memory. Traditional systems build symbolic maps of the world for navigational reference. Reactive methods, in contrast, eliminate or m...
Tucker R. Balch, Ronald C. Arkin
ICDE
1994
IEEE
135views Database» more  ICDE 1994»
15 years 11 months ago
QBISM: Extending a DBMS to Support 3D Medical Images
We describe the design and implementation of QBISM (Query By Interactive, Spatial Multimedia), a prototype for querying and visualizing 3D spatial data. Our first application is i...
Manish Arya, William F. Cody, Christos Faloutsos, ...
SC
1993
ACM
15 years 11 months ago
Runtime compilation techniques for data partitioning and communication schedule reuse
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations e ectively. The rst mechanism invokes a user speci ed mapping procedure via a s...
Ravi Ponnusamy, Joel H. Saltz, Alok N. Choudhary
PODC
2010
ACM
15 years 10 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer