68 search results - page 10 / 14 » Open Graphs and Monoidal Theories |
STOC
2010
ACM
14 years 12 days ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
SCA
2007
13 years 10 months ago
2007
We introduce a framework for advanced behavioral animation in virtual humans, which addresses the challenging open problem of simulating social interactions between pedestrians in...
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...