182 search results - page 13 / 37 » Infinite Possibilities |
STOC
2002
ACM
14 years 7 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
DLT
2010
13 years 7 months ago
2010
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of norma...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
INTETAIN
2009
Springer
14 years 1 months ago
2009
Springer
In this text, we intend to explore the possibilities of sound manipulation in a context of augmented reality (AR) through the use of robots. We use the random behaviour of robots i...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...