2084 search results - page 181 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
255
click to vote
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
152
click to vote
EDCC
2008
Springer
15 years 8 months ago
2008
Springer
Faults attacks are a powerful tool to break some implementations of robust cryptographic algorithms such as AES [8] and DES [3]. Various methods of faults attack on cryptographic ...
155
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
197
click to vote
REX
1991
15 years 10 months ago
1991
We survey logic-based and automata-based languages and techniques for the speci cation and veri cation of real-time systems. In particular, we discuss three syntactic extensions of...
133
click to vote
ICCAD
2007
IEEE
16 years 3 months ago
2007
IEEE
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...