EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 14 of 14

Basic education of CAD/CAM through multimedia and network aid.

Araki, Tsutomu (1998)

Journal for Geometry and Graphics

Basis of quartic splines over triangulation.

Pílnikova, Jana, Chalmovianský, Pavel (1999)

Journal for Geometry and Graphics

bdim: the Italian Digital Mathematical Library

Coti Zelati, Vittorio (2010)

Towards a Digital Mathematics Library. Paris, France, July 7-8th, 2010

We present bdim (Bibliteca Digitale Italiana di Matematica) the Italian project of math digitization. The project has been started by SIMAI (Società Italiana di Matematica Applicata e Industriale) and UMI (Unione Matematica Italiana) with initial support from the Biblioteca Digitale Italiana and the Italian Ministry of Beni and Attività Culturali and with the help of Numdam. At the moment bdim consists of approximately 1,300 articles, 11,000 pages (articles from Bollettino Unione Matematica Italiana,...

Better Lower Bounds on Detecting Affine and Spherical Degeneracies.

R. Seidel, J. Erickson (1995)

Discrete & computational geometry

Binary operations on automatic functions

Juhani Karhumäki, Jarkko Kari, Joachim Kupke (2008)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Real functions on the domain ${[0, 1)}^{n}$ – often used to describe digital images – allow for different well-known types of binary operations. In this note, we recapitulate how weighted finite automata can be used in order to represent those functions and how certain binary operations are reflected in the theory of these automata. Different types of products of automata are employed, including the seldomly-used full cartesian product. We show, however, the infeasibility of functional composition; simple examples...

Binary operations on automatic functions

Juhani Karhumäki, Jarkko Kari, Joachim Kupke (2007)

RAIRO - Theoretical Informatics and Applications

Real functions on the domain [0,1)n – often used to describe digital images – allow for different well-known types of binary operations. In this note, we recapitulate how weighted finite automata can be used in order to represent those functions and how certain binary operations are reflected in the theory of these automata. Different types of products of automata are employed, including the seldomly-used full Cartesian product. We show, however, the infeasibility of functional composition; simple...