A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
The choice and agreement problems of a random function
2018
Information Processing Letters
Preserved Fulltext
In this note, we observe that in a variety of computational models, if f is a random function then with high probability its corresponding choice and agreement problem are not much easier than computing ...
In order to study this question, Beimel et al [BBKW14] introduced the following related problems: • The choice problem: Given m distinct instances, choose one of them and solve it. • The agreement problem ...
We would also like to thank anonymous referees for comments that improved the presentation of this work, and also for pointing out an error in a previous version. ...
doi:10.1016/j.ipl.2017.12.007
fatcat:rqr7nxmkprfkpestgol5up25se
Simultaneity is harder than agreement
1991
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Specifically, our bound holds for any randomized protocol which solves either the simultaneous agreement problem or the distributed tiring squad problem. ...
Our results are proved for randomized protocols, for a benign failure model (crash faults), and for a weak adversary. ...
We also thank Yoram Moses, Nancy Lynch, and the referees for their helpful comments on earlier versions of this paper and Larry Stockmeyer for a helpful conversation. ...
doi:10.1016/0890-5401(91)90067-c
fatcat:hjyg5hso4nb65hnv55hwdhc7o4
Random Machines: A bagged-weighted support vector model with free kernel choice
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
However, its performance depends directly from the choice of the kernel function and their hyperparameters. ...
In this article, it is proposed a novel framework to deal with the kernel function selection called Random Machines. The results improved accuracy and reduced computational time. ...
If any kernel function applied in h r (x) does not do better than a random choice, then ACC r is closer to 0.5 and the probability of select that kernel function is next to zero. ...
arXiv:1911.09411v1
fatcat:c6qkgsvzozawjmhssbsvgik2gq
Random Machines: A Bagged-Weighted Support Vector Model with Free Kernel Choice
2021
Journal of Data Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper, we proposed a novel framework to deal with the kernel function selection called Random Machines. ...
Improvement of statistical learning models to increase efficiency in solving classification or regression problems is a goal pursued by the scientific community. ...
If any kernel function applied in h r (x) does not do better than a random choice, then ACC r is closer to 0.5 and the probability of select that kernel function is next to zero. ...
doi:10.6339/21-jds1014
fatcat:osvs45hjp5c4zc6zlv5yprshxi
Sifting attacks in finite-size quantum key distribution
2016
New Journal of Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
More precisely, we combine LCA sifting with a certain parameter estimation protocol, and we prove the finite-key security of this combination. ...
We analyze these two previously unnoticed problems, present eavesdropping strategies that exploit them, and find that the two problems are independent. ...
CP and SW are funded by Singapore's MOE Tier 3A Grant MOE2012-T3-1-009, and STW, Netherlands. ...
doi:10.1088/1367-2630/18/5/053001
fatcat:gbbze5eozzaava2pasrftnwmay
Random Machines Regression Approach: an ensemble support vector regression model with free kernel choice
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The results exhibited a good performance of Regression Random Machines through lower generalization error without needing to choose the best kernel function during tuning process. ...
model to regression problems. ...
Acknowledgements I would like to thank CAPES-CNPq, for financing this project and providing the necessary financial resources for the complete this research. ...
arXiv:2003.12643v1
fatcat:ofbc2udo6rak5ldruxg3wysymq
Distinct nodes visited by random walkers on scale-free networks
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The problem of finding the distinct nodes visited by W walkers, effectively, can be reduced to that of a single walker. ...
For a single random walker on complex networks, many properties such as the mean first passage time and cover time are known. ...
ACKNOWLEDGMENTS The authors would like to acknowledge Yagyik Goswami for the initial contribution he made to this work. ...
arXiv:1501.01246v2
fatcat:tzisa7ejzfdxjdgyf7kt4tyhxu
Concurrency Effects Over Variable-size Identifiers in Distributed Collaborative Editing
2013
ACM Symposium on Document Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
CRDTs for sequences model a document as a set of elements (character, line, paragraph, etc.) with unique identifiers, providing two commutative update operations: insert and delete. ...
The identifiers of elements can be either of fixed-size or variable-size. Recently, a strategy for assigning variable-size identifiers called LSEQ has been proposed for CRDTs for sequences. ...
Indeed, instead of synchronizing the set of users, we provide an a priori agreement by the mean of a hash function. ...
dblp:conf/doceng/NedelecMMD13a
fatcat:l534g56gdrb25icxq4kr36vhnu
Order-NGreen's Function Technique for Local Environment Effects in Alloys
1996
Physical Review Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In Fig. 2 we present the total energy of ordered and random Cu 75 Zn 25 as a function of lattice spacing. ...
The method is based on the Dyson equation for a cluster Green's function the dimension of which is reduced to a minimum due to a judicious choice of effective medium. ...
doi:10.1103/physrevlett.76.4203
pmid:10061227
fatcat:7llwvbii4fgnjjxgchjxya2liu
A unified framework for multi-agent agreement
2007
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems - AAMAS '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We present such a unification, the Distributed Optimal Agreement Framework, and show how it captures a wide variety of agreement problems. ...
Multi-Agent Agreement problems (MAP) -the ability of a population of agents to search out and converge on a common state -are central issues in many multi-agent settings, from distributed sensor networks ...
DOA FRAMEWORK The Distributed Optimal Agreement framework comprises a specification of a problem and a specification of the dynamics of the agents in solving that problem. ...
doi:10.1145/1329125.1329151
dblp:conf/atal/LakkarajuG07
fatcat:cjn2nqqjbfaslcnnq3qlvj5zxa
Security Analysis of the PACE Key-Agreement Protocol
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We show that the PACE protocol is secure in the real-or-random sense of Abdalla, Fouque and Pointcheval, under a number-theoretic assumption related to the Diffie-Hellman problem and assuming random oracles ...
We analyze the Password Authenticated Connection Establishment (PACE) protocol for authenticated key agreement, recently proposed by the German Federal Office for Information Security (BSI) for the deployment ...
We also thank the participants of the WG 16 sub group for the stimulating discussions, and Rainer Urian for feedback. ...
doi:10.1007/978-3-642-04474-8_3
fatcat:pyw5etkorbhp7phjrhivowm4ye
Page 42 of The Journal of Business Vol. 52, Issue 1
[page]
1979
The Journal of Business
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
approach would be natural here except for the following problem: There is no agreement among workers in the area on a “‘correct’’ choice of the function T. ...
The problem of finding the distribution of z, which is a known function of several random variables with a known distribution has been studied extensively as a part of distribution theory.*® And this standard ...
How Can Uncertainty Affect the Choice of Trade Agreements?
2016
The Economic Record
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
This paper analyzes how uncertainty and the timing of its resolution influence the formation and design of regional trade agreements. Two sources of uncertainty -in demand and costs -are considered. ...
Finally, we show that the timing of the resolution of uncertainty can significantly impact the type of trade agreement that countries wish to form. ...
Stage 1: The Choice of Trade Agreement In stage 1, before the state of the world is known, countries 1 and 2 choose a TA. ...
doi:10.1111/1475-4932.12241
fatcat:ulak5wnppnctrfklxoscmvtbsq
Fast generators for the Diffie–Hellman key agreement protocol and malicious standards
2006
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The Diffie-Hellman key agreement protocol is based on taking large powers of a generator of a prime-order cyclic group. Some generators allow faster exponentiation. ...
On the other hand, we show that if there is some case in which fast generators are less secure, then this could be used by a malicious authority to generate a standard for the Diffie-Hellman key agreement ...
We thank Steven Galbraith and Alfred Menezes for their useful comments. ...
doi:10.1016/j.ipl.2005.11.025
fatcat:p35atwh3bfhf3hvzyrx3j37tle
Generalized privacy amplification
1995
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
The results have applications to unconditionally secure secret-key agreement protocols and quantum cryptography, and they yield results on wiretap and broadcast channels for a considerably strengthened ...
This paper provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard, and Robert for a special scenario. ...
ACKNOWLEDGMENT The authors wish to thank C, Cachin, I. Damghd, M. Gander, J.-M. Robert, L. Salvail, M. Sfintha, and W. ...
doi:10.1109/18.476316
fatcat:wjbrqdvkyzbyvaxc6mc6vwfmua
« Previous
Showing results 1 — 15 out of 393,999 results