Sciweavers

18 search results - page 4 / 4
» dmtcs 2010
Sort
View
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
13 years 8 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
137views Mathematics» more  DMTCS 2010»
13 years 8 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
146views Mathematics» more  DMTCS 2010»
13 years 8 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...