Showing 12 of 232 papers

Combining analyses, combining optimizations

C. Click, K. Cooper
1995
1 reference

Modern optimizing compilers use several passes over a program's intermediate representation to generate good code. Many of these optimizations exhibit a phase-ordering problem. Getting the best code may require iterating optimizations until a fixed p...

Applications of Finite Automata Representing Large Vocabularies.

Claudio L. Lucchesi, Tomasz Kowaltowski
1993
1 reference

Abstract The construction of minimal acyclic deterministic partial finite automata to represent large natural language vocabularies is described. Applications of such automata include spelling checkers and advisers, multilanguage dictionaries, thesau...

Two-way string-matching

M. Crochemore, D. Perrin
1991
1 reference

article Free Access Share on Two-way string-matching Authors: Maxime Crochemore Univ. Paris, Paris, France Univ. Paris, Paris, FranceView Profile , Dominique Perrin Univ. Paris, Paris, France Univ. Paris, Paris, FranceView Profile Authors Info & Clai...

An Adaptive Hash Join Algorithm for Multiuser Environments.

Hansjörg Zeller, Jim Gray 0001
1990
1 reference

How to read floating point numbers accurately

William D. Clinger
1990
1 reference

Consider the problem of converting decimal scientific notation for a number into the best binary floating point approximation to that number, for some fixed precision. This problem cannot be solved using arithmetic of any fixed precision. Hence the I...

Efficient Implementation of Lattice Operations.

Hassan Aït-Kaci, Robert S. Boyer, Patrick Lincoln, Roger Nasr
1989
1 reference

Lattice operations such as greatest lower bound (GLB), least upper bound (LUB), and relative complementation (BUTNOT) are becoming more and more important in programming languages supporting object inheritance. We present a general technique for the ...

Reconstruction filters in computer-graphics

Don P. Mitchell, Arun N. Netravali
1988
1 reference

Problems of signal processing arise in image synthesis because of transformations between continuous and discrete representations of 2D images. Aliasing introduced by sampling has received much attention in graphics, but reconstruction of samples int...

Color image quantization for frame buffer display

{"Paul S. Heckbert"}
1982
1 reference

Algorithms for adaptive, tapered quantization of color images are described. The research is motivated by the desire to display high-quality reproductions of color images with small frame buffers. It is demonstrated that many color images which would...

Rundungsfehleranalyse einiger Verfahren zur Summation endlicher Summen

A. Neumaier
1974
1 reference

Abstract Der bei einer Summation auftretende Rundungsfehler kann als Maß für die Güte des verwendeten Verfahrens gelten. Im folgenden werden für mehrere Summierungsverfahren, unter anderem für das übliche und das Kahan‐Babuška‐Verfahren, a‐priori‐Sch...

A Study of Replacement Algorithms for Virtual-Storage Computer

L. Belady
1966
1 reference

One of the basic limitations of a digital computer is the size of its available memory. 1 In most cases, it is neither feasible nor economical for a user to insist that every problem program fit into memory. The number of words of information in a pr...