2610 search results - page 235 / 522 » Computational Probabilistic Non-interference |
134
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We present a framework for vision-assisted tagging of personal photo collections using context. Whereas previous efforts mainly focus on tagging people, we develop a uni...
146
click to vote
IWSAS
2001
Springer
15 years 8 months ago
2001
Springer
We seek to construct autonomous adaptive survivable systems that use active trust management to adapt their own behavior in the face of compromises in the computational environment...
132
click to vote
FOCS
2000
IEEE
15 years 8 months 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...
103
click to vote
COCO
1994
Springer
15 years 8 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
181
click to vote
ACIVS
2006
Springer
15 years 7 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...