Sciweavers

481 search results - page 24 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
ECAL
2005
Springer
14 years 2 months ago
Penrose Life: Ash and Oscillators
We compare the long term behaviour of Conway’s Game of Life cellular automaton, from initial random configurations, on a bounded rectangular grid and a bounded Penrose tiling gr...
Margaret Hill, Susan Stepney, Francis Wan
SIROCCO
2007
13 years 10 months ago
Fast Periodic Graph Exploration with Constant Memory
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...
CORR
2002
Springer
86views Education» more  CORR 2002»
13 years 8 months ago
Small Strictly Convex Quadrilateral Meshes of Point Sets
In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we sh...
David Bremner, Ferran Hurtado, Suneeta Ramaswami, ...
TIT
2010
107views Education» more  TIT 2010»
13 years 3 months ago
Information inequalities for joint distributions, with interpretations and applications
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
Mokshay M. Madiman, Prasad Tetali
LATIN
2004
Springer
14 years 1 months ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin