993 search results - page 89 / 199 » The Complexity of Probabilistic EL |
FOCS
2000
IEEE
14 years 8 days ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
ACIVS
2006
Springer
13 years 11 months ago
2006
Springer
Scene understanding is an important problem in intelligent robotics. Since visual information is uncertain due to several reasons, we need a novel method that has robustness to the...
FOSSACS
2006
Springer
13 years 11 months ago
2006
Springer
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...
DAC
1995
ACM
13 years 11 months ago
1995
ACM
- Power estimation in combinational modules is addressed from a probabilistic point of view. The zero-delay hypothesis is considered and under highly correlated input streams, the ...
WCE
2007
13 years 9 months ago
2007
— In this paper a new approach to optimize nuclear power plant designs based on global risk reduction are described. In design the focus is on as components quality as redundancy...