27 search results - page 5 / 6 » fsttcs 2006 |
136
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
147
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...
185
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a construction for runtime monitors that check real-time properties expressed in timed LTL (TLTL). Due to D'Souza's results, TLTL can be considered a ...
176
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
153
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a recta...