Sciweavers

3006 search results - page 108 / 602
» Dimensionality reduction and generalization
Sort
View
91
Voted
DLT
2007
15 years 2 months ago
From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes determin...
Marcella Anselmo, Dora Giammarresi, Maria Madonia
94
Voted
SODA
1997
ACM
76views Algorithms» more  SODA 1997»
15 years 2 months ago
Markov Chains for Linear Extensions, the Two-Dimensional Case
We study the generation of uniformly distributed linear extensions using Markov chains. In particular we show that monotone coupling from the past can be applied in the case of lin...
Stefan Felsner, Lorenz Wernisch
DEDS
1998
84views more  DEDS 1998»
15 years 11 days ago
Reduction of Timed Hybrid Systems
We consider a class of hybrid dynamical systems and obtain conditions under which the behavior of these systems can be reduced to a finite state automaton. Specifically, we consi...
S. Di Gennaro, C. Horn, Sanjeev R. Kulkarni, Peter...
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
15 years 5 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
102
Voted
RTA
2010
Springer
15 years 4 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram