7106 search results - page 443 / 1422 » Restricted Complexity, General Complexity |
180
click to vote
SRDS
2007
IEEE
16 years 1 months ago
2007
IEEE
Fault tolerant distributed protocols typically utilize a homogeneous fault model, either fail-crash or fail-Byzantine, where all processors are assumed to fail in the same manner....
214
click to vote
DAGM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We consider the problem of non-rigid, point-to-point registration of two 3D surfaces. To avoid restrictions on the topology, we represent the surfaces as a level-set of t...
208
click to vote
FSTTCS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
206
click to vote
ICSE
2007
IEEE-ACM
16 years 1 months ago
2007
IEEE-ACM
Safety-critical systems (whose anomalous behavior could have catastrophic consequences such as loss of human life) are becoming increasingly prevalent; standards such as DO-178B, ...
174
click to vote
LPAR
2007
Springer
16 years 1 months ago
2007
Springer
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...