432 search results - page 26 / 87 » Internally deterministic parallel algorithms can be fast |
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
UAI
1997
14 years 11 months ago
1997
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
LICS
1994
IEEE
15 years 1 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
PDP
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper we present an algorithm that can be used to implement sequential, causal, or cache consistency in distributed shared memory (DSM) systems. For this purpose it has a ...
86
Voted
PRL
2006
14 years 9 months ago
2006
Approaches analyzing local characteristics of an image prevail in image restoration. However, they are less effective in cases of restoring images degraded by large size point spr...