Results 51 to 60 of about 5,642,848 (291)
Bell Inequalities with One Bit of Communication
Entropy, 2019 We study Bell scenarios with binary outcomes supplemented by one bit of classical communication. We developed a method to find facet inequalities for such scenarios even when direct facet enumeration is not possible, or at least difficult.
Emmanuel Zambrini Cruzeiro +1 more
doaj +1 more source
Communication Complexity of Cake Cutting [PDF]
ACM Conference on Economics and Computation, 2017 We study classic cake-cutting problems, but in discrete models rather than using infinite-precision real values, specifically, focusing on their communication complexity.
Simina Brânzei, N. Nisan
semanticscholar +1 more source
Communication Complexity of Discrete Fair Division [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2017 We initiate the study of the communication complexity of fair division with indivisible goods. We focus on some of the most well studied fairness notions (envy-freeness, proportionality, and approx...
Benjamin Plaut, Tim Roughgarden
semanticscholar +1 more source
IEEE Access, 2022 The Practical Byzantine Fault Tolerant (PBFT) consensus algorithm has many advantages, which makes PBFT utilized widely. Nonetheless, PBFT is not suitable for large-scale node scenarios due to its high communication complexity and it also has an apparent
Yanhe Na +4 more
doaj +1 more source
Communication complexity of approximate Nash equilibria [PDF]
Symposium on the Theory of Computing, 2016 For a constant ϵ, we prove a (N) lower bound on the (randomized) communication complexity of ϵ-Nash equilibrium in two-player N x N games. For n-player binary-action games we prove an exp(n) lower bound for the (randomized) communication complexity of (ϵ,
Y. Babichenko, A. Rubinstein
semanticscholar +1 more source
Individual communication complexity
Journal of Computer and System Sciences, 2004 We initiate the theory of communication complexity of individual inputs held by the agents, rather than worst-case or average-case. We consider total, partial, and partially correct protocols, one-way versus two-way, with and without help bits. The results are expressed in trems of Kolmogorov complexity.
H.M. Buhrman (Harry) +3 more
openaire +5 more sources
Approximate regularised maximum-likelihood approach for censoring outliers
The Journal of Engineering, 2019 This study considers censoring outliers in a radar scenario with limited sample support. The problem is formulated as obtaining the regularised maximum likelihood (RML) estimate of the outlier index set.
Sudan Han +5 more
doaj +1 more source
New Bounds and a Generalization for Share Conversion for 3-Server PIR
Entropy, 2022 Private Information Retrieval (PIR) protocols, which allow the client to obtain data from servers without revealing its request, have many applications such as anonymous communication, media streaming, blockchain security, advertisement, etc.
Anat Paskin-Cherniavsky, Olga Nissenbaum
doaj +1 more source
A Note on the LogRank Conjecture in Communication Complexity
Mathematics, 2023 The LogRank conjecture of Lovász and Saks (1988) is the most famous open problem in communication complexity theory. The statement is as follows: suppose that two players intend to compute a Boolean function f(x,y) when x is known for the first and y for
Vince Grolmusz
doaj +1 more source
Stochastic channel model for simulation of mobile ad hoc networks
The Journal of Engineering, 2014 Channel models, applicable to mobile ad hoc network (MANET) simulations, need to be both accurate and computationally efficient. It has been shown that inaccuracies in the channel model can seriously affect various network performance measures.
Gunnar Eriksson +3 more
doaj +1 more source