30 search results - page 3 / 6 » fsttcs 2005 |
105
click to vote
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
We present novel algorithms for estimating the size of the natural join of two data streams that have efficient update processing times and provide excellent quality of estimates....
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper addresses the issue of confidentiality and declassification for global computing in a language-based security perspective. The purpose is to deal with new fo...
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges...
51
Voted
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
TPTL and MTL are two classical timed extensions of LTL. In this paper, we positively answer a 15-year-old conjecture that TPTL is strictly more expressive than MTL. But we show tha...