Sciweavers

1175 search results - page 52 / 235
» Abstract computability and algebraic specification
Sort
View
MKM
2005
Springer
14 years 1 months ago
Computational Origami of a Morley's Triangle
Abstract. We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process ...
Tetsuo Ida, Hidekazu Takahashi, Mircea Marin
ICALP
2004
Springer
14 years 1 months ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
EUROPAR
2009
Springer
14 years 8 days ago
Using Hybrid CPU-GPU Platforms to Accelerate the Computation of the Matrix Sign Function
Abstract. We investigate the performance of two approaches for matrix inversion based on Gaussian (LU factorization) and Gauss-Jordan eliminations. The target architecture is a cur...
Peter Benner, Pablo Ezzatti, Enrique S. Quintana-O...
ADG
2006
Springer
177views Mathematics» more  ADG 2006»
14 years 1 months ago
Recognition of Computationally Constructed Loci
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
Peter Lebmeir, Jürgen Richter-Gebert
WADT
1998
Springer
13 years 12 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...