#### Filter Results:

- Full text PDF available (31)

#### Publication Year

2000

2017

- This year (1)
- Last 5 years (13)
- Last 10 years (39)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Martin Steinebach, Jana Dittmann, +5 authors Frédéric Raynal
- ITCC
- 2001

In this paper we will briefly present the architecture of a public automated evaluation service we are developing for still images, sound and video. We will also detail new tests that will be… (More)

- Fabien A. P. Petitcolas, Martin Steinebach, Frédéric Raynal, Jana Dittmann, Caroline Fontaine, Nazim Fatès
- Security and Watermarking of Multimedia Contents
- 2001

One of the main problems, which darkens the future of digital watermarking technologies, is the lack of detailed evaluation of existing marking schemes. This lack of benchmarking of current… (More)

- Nazim Fatès
- Theory of Computing Systems
- 2012

In the density classification problem, a binary cellular automaton (CA) should decide whether an initial configuration contains more 0s or more 1s. The answer is given when all cells of the CA agree… (More)

- Nazim Fatès
- J. Cellular Automata
- 2009

Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible… (More)

- Nazim Fatès
- 2008

We address the question as to which are the minimal ingredients to obtain a decentralised gathering of agents that move on a lattice. The agents and their environment are described with a stochastic… (More)

- Nazim Fatès, Damien Regnault, Nicolas Schabanel, Eric Thierry
- LATIN
- 2006

In this paper we propose a probabilistic analysis of the asynchronous behavior of elementary finite cellular automata (i.e. {0, 1} states, radius 1 and unidimensional) for which both states are… (More)

- Ana Busic, Nazim Fatès, Jean Mairesse, Irène Marcovici
- LATIN
- 2012

Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classification problem, that is, we want to design a… (More)

- Nazim Fatès
- DMCS
- 2003

In [Gut89] Howard Gutowitz writes : “A fundamental problem in theory of cellular automata is classification. A good classification divides cellular automata into groups with meaningfully related… (More)

- Nazim Fatès, Michel Morvan, Nicolas Schabanel, Eric Thierry
- MFCS
- 2005

In this paper we propose a probabilistic analysis of the fully asynchronous behavior (i.e., two cells are never simultaneously updated, as in a continuous time process) of elementary finite cellular… (More)

- Nazim Fatès
- Swarm Intelligence
- 2010

The decentralised gathering problem consists in grouping in a compact cluster agents that are initially randomly scattered. We propose a bio-inspired algorithm, the Reaction–Diffusion–Chemotaxis… (More)