Suchergebnisse - "Message passing algorithm"
-
1
A Message-Passing Approach to Self-Organizing Internet-of-Things Based Public Safety Networks
ISSN: 2169-3536, 2169-3536Veröffentlicht: Piscataway IEEE 2018Veröffentlicht in IEEE access (2018)“… This paper develops a distributed self-organizing strategy for an Internet-of-Things (IoT)-based public safety network (IPSN). Recent advances in wireless …”
Volltext
Journal Article -
2
A Message Passing Algorithm for the Problem of Path Packing in Graphs
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 18.03.2016Veröffentlicht in arXiv.org (18.03.2016)“… We consider a variant of this problem where each path starts within a fixed subset of root nodes, subject to a given bound on the length of paths …”
Volltext
Paper -
3
Community Detection With Contextual Multilayer Networks
ISSN: 0018-9448, 1557-9654Veröffentlicht: New York IEEE 01.05.2023Veröffentlicht in IEEE transactions on information theory (01.05.2023)“… (MMSE) for estimating the common community structure in the balanced two block case using an orchestrated approximate message passing algorithm …”
Volltext
Journal Article -
4
Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming
ISSN: 0018-9448, 1557-9654Veröffentlicht: New York IEEE 01.10.2015Veröffentlicht in IEEE transactions on information theory (01.10.2015)“… Message-passing algorithms based on belief-propagation (BP) are successfully used in many applications, including decoding error correcting codes and solving constraint satisfaction and inference problems …”
Volltext
Journal Article -
5
The Overlap Gap Property and Approximate Message Passing Algorithms for \(p\)-spin models
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 26.11.2019Veröffentlicht in arXiv.org (26.11.2019)“… We consider the algorithmic problem of finding a near ground state (near optimal solution) of a \(p\)-spin model. We show that for a class of algorithms …”
Volltext
Paper -
6
A New Multiple Access Technique for 5G: Power Domain Sparse Code Multiple Access (PSMA)
ISSN: 2169-3536, 2169-3536Veröffentlicht: Piscataway IEEE 01.01.2018Veröffentlicht in IEEE access (01.01.2018)“… In this paper, a new approach for multiple access in the fifth generation (5G) of cellular networks called power domain sparse code multiple access (PSMA) is …”
Volltext
Journal Article -
7
Cloud-Assisted Data Fusion and Sensor Selection for Internet of Things
ISSN: 2327-4662, 2327-4662Veröffentlicht: Piscataway IEEE 01.06.2016Veröffentlicht in IEEE internet of things journal (01.06.2016)“… One major challenge for the IoT is to handle vast amount of sensing data generated from the smart devices that are resource-limited and subject to missing data due to link or node failures …”
Volltext
Journal Article -
8
On the Sparsity of Spreading Sequences for NOMA with Reliability Guarantee and Detection Complexity Limitation
Veröffentlicht: IEEE 01.06.2017Veröffentlicht in 2017 IEEE 85th Vehicular Technology Conference (VTC Spring) (01.06.2017)“… , the message passing algorithm (MPA) for low-complexity and highly- reliable multiuser detection …”
Volltext
Tagungsbericht -
9
Deep learning-based Collision-aware Multi-user Detection for Grant-free Sparse Code Multiple Access Systems
Veröffentlicht: IEEE 19.11.2023Veröffentlicht in 2023 28th Asia Pacific Conference on Communications (APCC) (19.11.2023)“… ) at the base station (BS). The existing methods modify the factor graph on the message-passing algorithm (MPA …”
Volltext
Tagungsbericht -
10
Pathway Graphical Lasso
ISSN: 2159-5399Veröffentlicht: United States 01.01.2015Veröffentlicht in Proceedings of the ... AAAI Conference on Artificial Intelligence (01.01.2015)“… The approach attempts to learn the structure of a Gaussian graphical model (GGM) by maximizing the log likelihood of the data, subject to an penalty on the elements of the inverse co-variance matrix …”
Weitere Angaben
Journal Article -
11
Video Analysis for Understanding Human Actions and Interactions
ISBN: 9798762121156Veröffentlicht: ProQuest Dissertations & Theses 01.01.2021“… Each time that we act, our actions are not just conditioned by the spatial information, e.g., objects, people, and the scene where we are involved. These …”
Volltext
Dissertation -
12
Analysis and Design of Communication Policies for Energy-constrained Machine-type Devices
ISBN: 9798662443501Veröffentlicht: ProQuest Dissertations & Theses 01.01.2020“… This thesis focuses on the modelling, analysis and design of novel communication strategies for wireless machine-type communication (MTC) systems to realize …”
Volltext
Dissertation -
13
An efficient Monte Carlo approach for optimizing decentralized estimation networks constrained by undirected topologies
ISBN: 9781424427093, 1424427096ISSN: 2373-0803Veröffentlicht: IEEE 01.08.2009Veröffentlicht in 2009 IEEE/SP 15th Workshop on Statistical Signal Processing (01.08.2009)“… We consider a decentralized estimation network subject to communication constraints such that nearby platforms can communicate with each other through low capacity links rendering an undirected graph …”
Volltext
Tagungsbericht -
14
Multimodal data integration and cross-modal querying via orchestrated approximate message passing
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 24.08.2024Veröffentlicht in arXiv.org (24.08.2024)“… Under a dependent multifactor model, we develop a fully data-driven orchestrated approximate message passing algorithm for integrating information across these feature sets to achieve statistically …”
Volltext
Paper -
15
Virtual Full Duplex Wireless Networks
ISBN: 9781267620767, 1267620765Veröffentlicht: ProQuest Dissertations & Theses 01.01.2012“… A novel paradigm is proposed in this thesis for designing the physical and medium access control (MAC) layers of wireless ad hoc or peer-to-peer networks …”
Volltext
Dissertation -
16
LDPC Codes on Finite Fields: Construction, Reduced-Complexity Iterative Decoding and Cycle Counting
ISBN: 9781369201024, 1369201028Veröffentlicht: ProQuest Dissertations & Theses 01.01.2016“… Subjects to be investigated include: (1) flexible and systematic methods for constructing binary LDPC codes with quasi-cyclic structure based on finite fields; (2 …”
Volltext
Dissertation -
17
Efficient algorithm for routing optimization via statistical mechanics
ISSN: 2164-7038Veröffentlicht: 01.06.2013Veröffentlicht in 2013 IEEE International Conference on Communications Workshops (ICC) (01.06.2013)“… A distributive message-passing algorithm capable of optimizing the path configuration in real instances is devised, based on the analytical derivation, and is greatly simplified by expanding the cost …”
Volltext
Tagungsbericht -
18
Optimal Algorithms for Submodular Maximization with Distributed Constraints
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 18.11.2020Veröffentlicht in arXiv.org (18.11.2020)“… Given this distributed setting, we develop Constraint-Distributed Continuous Greedy (CDCG), a message passing algorithm that converges to the tight …”
Volltext
Paper -
19
Submatrix localization via message passing
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 30.10.2015Veröffentlicht in arXiv.org (30.10.2015)“… )\) misclassification errors on average) by an optimized message passing algorithm if \(\lambda = \mu^2K^2/n\), the signal-to-noise ratio, exceeds …”
Volltext
Paper -
20
Achieving accurate opinion consensus in large multi-agent systems
Veröffentlicht: ProQuest Dissertations & Theses 01.01.2013“… Modern communication technologies offer the means to share information within decentralised,large and complex networks of agents. A significant number of …”
Volltext
Dissertation

