Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,114
A Case for Source-Level Transformations in MATLAB
- In Proceedings of the Second Conference on Domain-Specific Languages
, 1999
"... In this paper, we discuss various performance overheads in MATLAB codes and propose different program transformation strategies to overcome them. In particular, we demonstrate that high-level source-to-source transformations of MATLAB programs are effective in obtaining substantial performance gains ..."
Abstract
-
Cited by 24 (1 self)
- Add to MetaCart
are interpreted, making MAT- 0 This work was supported by NSF grants CCR-9720211, EIA-9726388 and ACI-9870...
A subordinated stochastic process model with finite variance for speculative prices
- Econometrica
, 1973
"... Thanks are due to Hendrik Houthakker and Christopher Sims, for both encouragement and advice in developing this paper. As usual, all remaining errors are my own. This research was supported by a Harvard Dissertation Fellowship, NSF grant 33-708, and the ..."
Abstract
-
Cited by 561 (1 self)
- Add to MetaCart
Thanks are due to Hendrik Houthakker and Christopher Sims, for both encouragement and advice in developing this paper. As usual, all remaining errors are my own. This research was supported by a Harvard Dissertation Fellowship, NSF grant 33-708, and the
An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition
, 1997
"... This document has been prepared using the L a T E X system. We thank Donald Knuth for T E X, Leslie Lamport for L a T E X, and Jan van der Steen at CWI for online help. Some figures were prepared by John Tromp using the xpic program. The London Mathematical Society kindly gave permission to reproduc ..."
Abstract
-
Cited by 2138 (120 self)
- Add to MetaCart
to reproduce a long extract by A.M. Turing. The Indian Statistical Institute, through the editor of Sankhy¯a, kindly gave permission to quote A.N. Kolmogorov. We gratefully acknowledge the financial support by NSF Grant DCR8606366, ONR Grant N00014-85-k-0445, ARO Grant DAAL03-86-K0171, the Natural Sciences
Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
- In Proceedings of the 2000 ACM International Conference on Supercomputing
, 2000
"... We present an approach for synthesizing transformations to enhance locality in imperfectly-nested loops. The key idea is to embed the iteration space of every statement in a loop nest into a special iteration space called the product space. The product space can be viewed as a perfectly-nested loop ..."
Abstract
-
Cited by 64 (3 self)
- Add to MetaCart
property, permitting the full machinery of matrix methods and lattice theory to ¢ This work was supported by NSF grants CCR-9720211, EIA-9726388, ACI-9870687,EIA-9972853. £ A perfectly-nested loop is a set of loops in which all assignment statements are contained in the innermost loop.
Self-Testing/Correcting with Applications to Numerical Problems
, 1990
"... Suppose someone gives us an extremely fast program P that we can call as a black box to compute a function f . Should we trust that P works correctly? A self-testing/correcting pair allows us to: (1) estimate the probability that P (x) 6= f(x) when x is randomly chosen; (2) on any input x, compute ..."
Abstract
-
Cited by 361 (27 self)
- Add to MetaCart
f(x) correctly as long as P is not too faulty on average. Furthermore, both (1) and (2) take time only slightly more than Computer Science Division, U.C. Berkeley, Berkeley, California 94720, Supported by NSF Grant No. CCR 88-13632. y International Computer Science Institute, Berkeley
On visible surface generation by a priori tree structures
- Computer Graphics
, 1980
"... This paper describes a new algorithm for solving the hidden surface (or line) problem, to more rapidly generate realistic images of 3-D scenes composed of polygons, and presents the development of theoretical foundations in the area as well as additional related algorithms. As in many applications t ..."
Abstract
-
Cited by 370 (6 self)
- Add to MetaCart
specifying parameters zor an image (using knobs, switches, or cockpit controls) and the *This research was partially supported by NSF under Grants MCS79-00168 and MC579-02593, and was zacilitated by the use of
A Safe Approximate Algorithm for Interprocedural Pointer Aliasing
, 1992
"... Aliasing occurs at some program point during execution when two or more names exist for the same location. In a language which allows pointers, the problem of determining the set of pairs of names at a program point which may refer to the same location during program execution is NP-hard. We present ..."
Abstract
-
Cited by 351 (31 self)
- Add to MetaCart
present an algorithm which safely approximates Interprocedural May Alias in the presence of pointers. This algorithm has been implemented in a prototype analysis tool for C programs. 3 The research reported here was supported, in part, by Siemens Research Corporation and NSF grant CCR8920078. y
Universal One-Way Hash Functions and their Cryptographic Applications
, 1989
"... We define a Universal One-Way Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x in the domain, it is computationally hard to find a different domain element which collides with x. We ..."
Abstract
-
Cited by 351 (15 self)
- Add to MetaCart
author was supported in part by NSF grant CCR-88 13632. A preliminary version of this work app...
Abstract Tiling Imperfectly-nested Loop Nests
"... Tiling is one of the more important transformations for enhancing locality of reference in programs. Tiling of perfectly-nested loop nests (which are loop nests in which all assignment statements are contained in the innermost loop) is well understood. In practice, most loop nests are imperfectly-ne ..."
Abstract
- Add to MetaCart
] for algorithms of interest to their community. However, these 0This work was supported by NSF grants CCR-9720211, EIA-9726388
NSF.
"... tinguished from Engineering Technology educa-tion) is a design problem. In engineering, an important consideration is to determine the goal of the design. What is the desired result? For whom is it desirable? What are the unintended consequences? I continue to raise the question of what should the g ..."
Abstract
- Add to MetaCart
the goal be for technology edu-cation. What are the design issues? In the last few years I have become enam-ored with the monograph, Understanding by Design, by Grant Wiggins and Jay McTighe (Wiggins & McTighe, 2005). Their use of design is probably more synonymous with pur-pose. In this book
Results 1 - 10
of
2,114
