Sciweavers

8 search results - page 1 / 2
» Convex Hull of Arithmetic Automata
Sort
View
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 4 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux
COMPGEOM
2001
ACM
13 years 8 months ago
The convex hull of ellipsoids
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
MFCS
2007
Springer
13 years 11 months ago
Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods
In this paper we study language recognition by two-dimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearl...
Martin Delacourt, Victor Poupet
SCIA
2005
Springer
110views Image Analysis» more  SCIA 2005»
13 years 10 months ago
Training Cellular Automata for Image Processing
Experiments were carried out to investigate the possibility of training cellular automata to to perform processing. Currently, only binary images are considered, but the space of r...
Paul L. Rosin
SASO
2008
IEEE
13 years 11 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau