8196 search results - page 196 / 1640 » Computational Modeling and Complexity Science |
139
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
142
click to vote
ITICSE
1997
ACM
15 years 10 months ago
1997
ACM
A programming exercise on recursion in which students create drawings of simple and bracketed Lindenmayer Systems provides a context for exploring additional computer science conc...
179
click to vote
IJON
2000
15 years 6 months ago
2000
We present a software package for the simulation of very large neuronal networks on parallel computers. The package can be run on any system with an implementation of the Message ...
251
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
155
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...