26 search results - page 2 / 6 » Real Computation with Least Discrete Advice: A Complexity Th... |
PODC
2006
ACM
14 years 5 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
RTSS
2003
IEEE
13 years 11 months ago
2003
IEEE
We describe the Timed Input/Output Automata (TIOA) framework, a general mathematical framework for modeling and analyzing real-time systems. It is based on timed I/O automata, whi...
CGF
2007
13 years 6 months ago
2007
This paper proposes a real-time simulation technique for thin shells undergoing large deformation. Shells are thin objects such as leaves and papers that can be abstracted as 2D s...
COLT
1993
Springer
13 years 10 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
COMPGEOM
2008
ACM
13 years 8 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...