Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
8,640
Automatic Transformations by Rewriting Techniques
, 1994
"... . The paper shows how term rewriting techniques can be used to automatically transform first-order functional programs by both deforestation (eliminating useless intermediate data structures) and tupling (eliminating parallel traversals of identical data structures). Its novelty is that it include ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
. The paper shows how term rewriting techniques can be used to automatically transform first-order functional programs by both deforestation (eliminating useless intermediate data structures) and tupling (eliminating parallel traversals of identical data structures). Its novelty
Why Automatic Transformation Matters
"... rtance when software is generated from specifications given in a declarative, domain-specific language, rather than being programmed directly by a human. A program naively generated by direct interpretation of the semantics of the high level specification may have performance parameters that are ord ..."
Abstract
- Add to MetaCart
that are orders of magnitude removed from what is desired and could be achieved by detailed programming. Automatic transformation, incorporating partial evaluation, recursion elimination, and fusion of control structures can specialize the naive interpretation, adapting it to a particular term given
A Transformation System for Developing Recursive Programs
, 1977
"... A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations ..."
Abstract
-
Cited by 649 (3 self)
- Add to MetaCart
are given, and a tentative implementation !s described Alternative structures for programs are shown, and a possible initial phase for an automatic or semiautomatic program manipulation system is lndmated KEY WORDS AND PHRASES program transformation, program mampulatlon, optimization, recursion CR
Text Chunking using Transformation-Based Learning
, 1995
"... Eric Brill introduced transformation-based learning and showed that it can do part-ofspeech tagging with fairly high accuracy. The same method can be applied at a higher level of textual interpretation for locating chunks in the tagged text, including non-recursive "baseNP" chunks. For ..."
Abstract
-
Cited by 523 (0 self)
- Add to MetaCart
Eric Brill introduced transformation-based learning and showed that it can do part-ofspeech tagging with fairly high accuracy. The same method can be applied at a higher level of textual interpretation for locating chunks in the tagged text, including non-recursive "baseNP" chunks
The design and implementation of FFTW3
- PROCEEDINGS OF THE IEEE
, 2005
"... FFTW is an implementation of the discrete Fourier transform (DFT) that adapts to the hardware in order to maximize performance. This paper shows that such an approach can yield an implementation that is competitive with hand-optimized libraries, and describes the software structure that makes our cu ..."
Abstract
-
Cited by 726 (3 self)
- Add to MetaCart
of the discrete cosine and sine transforms automatically from a DFT algorithm.
AFNI: software for analysis and visualization of functional magnetic resonance neuroimages
- Computers and Biomedical Research
, 1996
"... email rwcoxmcwedu A package of computer programs for analysis and visualization of threedimensional human brain functional magnetic resonance imaging FMRI results is described The software can color overlay neural activation maps onto higher resolution anatomical scans Slices in each cardinal pl ..."
Abstract
-
Cited by 807 (3 self)
- Add to MetaCart
plane can be viewed simultaneously Manual placement of markers on anatom ical landmarks allows transformation of anatomical and functional scans into stereotaxic TalairachTournoux coordinates The techniques for automatically generating transformed functional data sets from manually labeled anatomical
Program Analysis and Specialization for the C Programming Language
, 1994
"... Software engineers are faced with a dilemma. They want to write general and wellstructured programs that are flexible and easy to maintain. On the other hand, generality has a price: efficiency. A specialized program solving a particular problem is often significantly faster than a general program. ..."
Abstract
-
Cited by 629 (0 self)
- Add to MetaCart
with efficiency. This thesis presents an automatic partial evaluator for the Ansi C programming language. The content of this thesis is analysis and transformation of C programs. We develop several analyses that support the transformation of a program into its generating extension. A generating extension is a
Local grayvalue invariants for image retrieval
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1997
"... Abstract—This paper addresses the problem of retrieving images from large image databases. The method is based on local grayvalue invariants which are computed at automatically detected interest points. A voting algorithm and semilocal constraints make retrieval possible. Indexing allows for efficie ..."
Abstract
-
Cited by 548 (27 self)
- Add to MetaCart
Abstract—This paper addresses the problem of retrieving images from large image databases. The method is based on local grayvalue invariants which are computed at automatically detected interest points. A voting algorithm and semilocal constraints make retrieval possible. Indexing allows
Bandera: Extracting Finite-state Models from Java Source Code
- IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finite-state verification techniques, such as model checking, have shown promise as a cost-effective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract
-
Cited by 654 (33 self)
- Add to MetaCart
), and difficult to optimize (which is necessary to combat the exponential complexity of verification algorithms). In this paper, we describe an integrated collection of program analysis and transformation components, called Bandera, that enables the automatic extraction of safe, compact finite-state models from
Results 1 - 10
of
8,640
