Results 261 to 270 of about 12,738,743 (318)

Early Stopping for Any Number of Corruptions

IACR Cryptology ePrint Archive, 2023
Minimizing the round complexity of byzantine broadcast is a fundamental question in distributed computing and cryptography. In this work, we present the first early stopping byzantine broadcast protocol that tolerates up to t = n−1 malicious corruptions and terminates in O(min{f 2 , t+ 1}) rounds for any execution with f ≤ t actual corruptions.
J. Loss, Jesper Buus Nielsen
semanticscholar   +4 more sources

Operation-Level Early Stopping for Robustifying Differentiable NAS

Neural Information Processing Systems, 2023
Differentiable NAS (DARTS) is a simple and efficient neural architecture search method that has been extensively adopted in various machine learning tasks.
Shen Jiang   +4 more
semanticscholar   +1 more source

Early-Stopping for RAKE Receivers

2005 2nd International Symposium on Wireless Communication Systems, 2005
In this paper, a statistical method to reduce the computation in a spread-spectrum RAKE receiver is proposed. The fundamental idea is to stop the integration of the received signal during despreading earlier than in the conventional RAKE, when the intermediate integrated output is greater than a predefined threshold.
Sung-Chul Han, Rohit Negi
openaire   +2 more sources

Early stopping in Byzantine agreement

Journal of the ACM, 1990
Two different kinds of Byzantine Agreement for distributed systems with processor faults are defined and compared. The first is required when coordinated actions may be performed by each participant at different times. This kind is called Simultaneous Byzantine Agreement (SBA).This paper deals with the number of rounds of message exchange required to ...
Danny Dolev   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy