Sciweavers

4581 search results - page 6 / 917
» Computing Transformation Semigroups
Sort
View
NC
2011
236views Neural Networks» more  NC 2011»
14 years 7 months ago
Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be ap...
Hans-Jörg Kreowski, Sabine Kuske
142
Voted
CSR
2008
Springer
15 years 6 months ago
The Most General Conservation Law for a Cellular Automaton
Abstract. We study the group-valued and semigroup-valued conservation laws in cellular automata (CA). We provide examples to distinguish between semigroup-valued, group-valued and ...
Enrico Formenti, Jarkko Kari, Siamak Taati
ICCV
2011
IEEE
14 years 4 months ago
Blurring-Invariant Riemannian Metrics for Comparing Signals and Images
We propose a novel Riemannian framework for comparing signals and images in a manner that is invariant to their levels of blur. This framework uses a log-Fourier representation of...
Zhengwu Zhang, Eric Klassen, Anuj Srivastava, Pava...
FCT
2007
Springer
15 years 10 months ago
The Quantum Query Complexity of Algebraic Properties
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
Sebastian Dörn, Thomas Thierauf
TAMC
2007
Springer
15 years 10 months ago
Synchronization of Some DFA
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. ˇCerny co...
A. N. Trahtman