1716 search results - page 314 / 344 » Proving Conditional Termination |
201
Voted
GAMESEC
2011
14 years 11 days ago
2011
Recent works on Internet risk management have proposed the idea of cyber-insurance to eliminate risks due to security threats, which cannot be tackled through traditional means suc...
117
click to vote
PODC
2012
ACM
13 years 3 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
TIT
1998
15 years 10 days ago
1998
—Given n discrete random variables = fX1;111; Xng, associated with any subset of f1; 2; 111; ng, there is a joint entropy H(X ) where X = fXi:i 2 g. This can be viewed as a f...
108
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
We assess the applicability of several popular learning methods for the problem of recognizing generic visual categories with invariance to pose, lighting, and surrounding clutter...
103
click to vote
ICCV
2001
IEEE
16 years 2 months ago
2001
IEEE
This paper presents a novel modeling algorithm that is capable of simultaneously recovering correct shape geometry as well as its unknown topology from arbitrarily complicated dat...