4926 search results - page 606 / 986 » Two Graph Algorithms On an Associative Computing Model |
127
Voted
CONCUR
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
124
click to vote
SDM
2008
SIAM
15 years 4 months ago
2008
SIAM
Currently, many privacy-preserving data mining (PPDM) algorithms assume the semi-honest model and/or malicious model of multi-party interaction. However, both models are far from ...
130
click to vote
PPL
2008
15 years 2 months ago
2008
The model of bulk-synchronous parallel computation (BSP) helps to implement portable general purpose algorithms while keeping predictable performance on different parallel compute...
137
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tap...
105
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...