Sciweavers

1646 search results - page 35 / 330
» Automatic generation of two-party computations
Sort
View
ISPAN
2002
IEEE
14 years 18 days ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
SAMOS
2010
Springer
13 years 6 months ago
Accelerating high-level engineering computations by automatic compilation of Geometric Algebra to hardware accelerators
Abstract—Geometric Algebra (GA), a generalization of quaternions, is a very powerful form for intuitively expressing and manipulating complex geometric relationships common to en...
Jens Huthmann, Peter Muller, Florian Stock, Dietma...
GG
2004
Springer
14 years 1 months ago
Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems
Abstract. Code generators are widely used in the development of embedded software to automatically generate executable code from graphical specifications. However, at present, cod...
Paolo Baldan, Barbara König, Ingo Stürme...
ISVC
2010
Springer
13 years 5 months ago
Computer-Assisted Creation of 3D Models of Freeway Interchanges
Abstract. Several existing procedural modeling systems are able to generate large 3D models of cities. However, none of these systems can automatically create 3D models of freeways...
Soon Tee Teoh

Publication
108views
13 years 9 months ago
A Compiler Generator Produced by a Self-Applicable Specializer Can Have a Surprisingly Natural and Understandable Structure
This paper describes the structure of, and the ideas behind, a self-applicable specializer of programs, as well as the principles of operation of a compiler generator that has been...
Sergei A. Romanenko