Sciweavers

Share
DMTCS
2010
137views Mathematics» more  DMTCS 2010»
9 years 4 months ago
Deterministic recognizability of picture languages with Wang automata
We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessell...
Violetta Lonati, Matteo Pradella
DMTCS
2010
109views Mathematics» more  DMTCS 2010»
9 years 4 months ago
On the number of balanced words of given length and height over a two letter alphabet
Nicolas Bedaride, Eric Domenjoud, Damien Jamet, Je...
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
9 years 4 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...
DMTCS
2010
145views Mathematics» more  DMTCS 2010»
9 years 4 months ago
Asymptotic enumeration of orientations
We find the asymptotic number of 2-orientations of quadrangulations with n inner faces, and of 3orientations of triangulations with n inner vertices. We also find the asymptotic n...
Stefan Felsner, Éric Fusy, Marc Noy
DMTCS
2010
150views Mathematics» more  DMTCS 2010»
9 years 4 months ago
The expected number of inversions after n adjacent transpositions
We give a new expression for the expected number of inversions in the product of
Mireille Bousquet-Mélou
DMTCS
2010
123views Mathematics» more  DMTCS 2010»
9 years 4 months ago
A characterization of infinite smooth Lyndon words
In a recent paper, Brlek, Jamet and Paquin showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: are they the only...
Geneviève Paquin
DMTCS
2010
128views Mathematics» more  DMTCS 2010»
9 years 4 months ago
Asymptotics of the Stirling numbers of the first kind revisited: A saddle point approach
Using the saddle point method, we obtain from the generating function of the Stirling numbers of the first kind n j and Cauchy's integral formula, asymptotic results in centr...
Guy Louchard
DMTCS
2010
125views Mathematics» more  DMTCS 2010»
9 years 4 months ago
On the analysis of "simple" 2D stochastic cellular automata
Damien Regnault, Nicolas Schabanel, Eric Thierry
DMTCS
2010
133views Mathematics» more  DMTCS 2010»
9 years 4 months ago
An improved bound on the largest induced forests for triangle-free planar graphs
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of S...
Lukasz Kowalik, Borut Luzar, Riste Skrekovski
ICUMT
2009
9 years 4 months ago
SBCL - improved centroid estimation
Localization of sensor nodes is one of the key issues in Wireless Sensor Networks. It is a precondition for a variety of applications, as well as geographic clustering and routing....
Ralf Behnke, Jakob Salzmann, Dirk Timmermann
books