Results 41 to 50 of about 5,642,848 (291)
Learning Complexity vs. Communication Complexity [PDF]
2008 23rd Annual IEEE Conference on Computational Complexity, 2008 This paper has two main focal points. We first consider an important class of machine learning algorithms: large margin classifiers, such as Support Vector Machines. The notion of margin complexity quantifies the extent to which a given class of functions can be learned by large margin classifiers.
Nati Linial, Adi Shraibman
openaire +1 more source
The communication complexity of payment computation [PDF]
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021 Let $(f,P)$ be an incentive compatible mechanism where $f$ is the social choice function and $P$ is the payment function. In many important settings, $f$ uniquely determines $P$ (up to a constant) and therefore a common approach is to focus on the design of $f$ and neglect the role of the payment function.
Shahar Dobzinski, Shiri Ron
openaire +2 more sources
Improved PBFT Algorithm Based on Comprehensive Evaluation Model
Applied Sciences, 2023 Blockchain technology is well known due to the advent of Bitcoin. With the development of recent years, blockchain technology has been widely used in medicine, digital currency, energy, etc.
Wangxi Jiang +4 more
doaj +1 more source
Integrating Low-Complexity and Flexible Sensing Into Communication Systems [PDF]
IEEE Journal on Selected Areas in Communications, 2021 Integrating sensing into standardized communication systems can potentially benefit many consumer applications that require both radio frequency functions.
Kai Wu +3 more
semanticscholar +1 more source
Chirp pseudo‐noise signal and its receiving scheme for LEO enhanced GNSS
IET Radar, Sonar & Navigation, 2022 Low earth orbit (LEO) constellations for enhancing global navigation satellite systems (GNSS) have been investigated and studied due to their higher floor power and rapid geometric changes. Compared with GNSS based on medium orbit (MEO) and geostationary
Xin Zhao +4 more
doaj +1 more source
The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication [PDF]
Annual Conference Computational Learning Theory, 2021 We resolve the min-max complexity of distributed stochastic convex optimization (up to a log factor) in the intermittent communication setting, where M machines work in parallel over the course of R rounds of communication to optimize the objective, and ...
Blake E. Woodworth +3 more
semanticscholar +1 more source
IoT-based cyber-physical communication architecture: challenges and research directions
IET Cyber-Physical Systems, 2019 In order to provide intelligent services, the Internet of Things (IoT) facilitates millions of smart cyber-physical devices to be enabled with network connectivity to sense, collect, process, and exchange information.
Md Masud Rana, Rui Bo, Rui Bo
doaj +1 more source
Analyzing the maximum angle of light‐emitting diodes for indoor visible light communication
Electronics Letters, 2023 In this letter, an optimal arrangement of the Light‐Emitting Diodes (LED) for an indoor Visible Light Communication (VLC) setup is presented by using the simulation model.
Arbaiah Inn +4 more
doaj +1 more source
On Share Conversions for Private Information Retrieval
Entropy, 2019 Beimel et al. in CCC 12’ put forward a paradigm for constructing Private Information Retrieval (PIR) schemes, capturing several previous constructions for k ≥ 3 servers. A key component in the paradigm, applicable to three-server PIR,
Anat Paskin-Cherniavsky, Leora Schmerler
doaj +1 more source
Communication memento: Memoryless communication complexity
CoRR, 2020 We study the communication complexity of computing functions $F:\{0,1\}^n\times \{0,1\}^n \rightarrow \{0,1\}$ in the memoryless communication model. Here, Alice is given $x\in \{0,1\}^n$, Bob is given $y\in \{0,1\}^n$ and their goal is to compute F(x,y) subject to the following constraint: at every round, Alice receives a message from Bob and her ...
Arunachalam, Srinivasan +1 more
openaire +4 more sources