131
Voted
FSTTCS
15 years 6 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....
104
click to vote
FSTTCS
15 years 6 months ago
2005 Springer
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that ...
78
Voted
FSTTCS
15 years 6 months ago
2005 Springer 125
click to vote
FSTTCS
15 years 6 months ago
2005 Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
114
click to vote
FSTTCS
15 years 6 months ago
2005 Springer
Abstract. Message sequence charts (MSCs) are commonly used to specify interactions between agents in communicating systems. Their visual nature makes them attractive for describing...
|