Sciweavers

4281 search results - page 855 / 857
» How to Disembed a Program
Sort
View
ICS
2001
Tsinghua U.
13 years 12 months ago
Optimizing strategies for telescoping languages: procedure strength reduction and procedure vectorization
At Rice University, we have undertaken a project to construct a framework for generating high-level problem solving languages that can achieve high performance on a variety of pla...
Arun Chauhan, Ken Kennedy
ICS
2001
Tsinghua U.
13 years 12 months ago
Slice-processors: an implementation of operation-based prediction
We describe the Slice Processor micro-architecture that implements a generalized operation-based prefetching mechanism. Operation-based prefetchers predict the series of operation...
Andreas Moshovos, Dionisios N. Pnevmatikatos, Amir...
HPDC
2000
IEEE
13 years 12 months ago
Creating Large Scale Database Servers
The BaBar experiment at the Stanford Linear Accelerator Center (SLAC) is designed to perform a high precision investigation of the decays of the B-meson produced from electron-pos...
Jacek Becla, Andrew Hanushevsky
ISSTA
2000
ACM
13 years 11 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
13 years 11 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas