Results 11 to 20 of about 17,132 (259)

Distributed greedy pursuit algorithms [PDF]

Signal Processing, 2014
For compressed sensing over arbitrarily connected networks, we consider the problem of estimating underlying sparse signals in a distributed manner. We introduce a new signal model that helps to describe inter-signal correlation among connected nodes.
Dennis Sundman, Saikat Chatterjee, Mikael Skoglund   +2 more
openaire   +4 more sources

Greedy Algorithms for Nonnegativity-Constrained Simultaneous Sparse Recovery. [PDF]

Signal Processing, 2016
Kim D, Haldar JP.
europepmc   +2 more sources

Improved Performance of Mean Greedy Algorithm for Chunk Allocation in SC-FDMA Uplink Systems using Joint-User and Chunk-Based Allocation

Journal of ICT Research and Applications, 2014
In this paper, the problem of subcarrier allocation on chunk-by-chunk basis in SC-FDMA uplink systems is investigated. Improved mean enhanced greedy algorithms are proposed for performing joint-user and chunk-based allocation at each transmission time ...
Arfianto Fahmi, Muhamad Asvial, Dadang Gunawan   +2 more
doaj   +1 more source

A Hybrid Virtual Network Function Placement Strategy for Maximizing the Profit of Network Service Deployment Over Time-Varying Workloads

IEEE Access, 2021
The emergence of network function virtualization (NFV) has revolutionized the infrastructure and service management of network architecture. It allows network operators to reduce costs and improve the agility of network service deployment.
Chi-Chen Yang, Satyajit Padhy, Jerry Chou   +2 more
doaj   +1 more source

Sharp sufficient condition for the convergence of greedy expansions with errors in coefficient computation

Demonstratio Mathematica, 2022
Generalized approximate weak greedy algorithms (gAWGAs) were introduced by Galatenko and Livshits as a generalization of approximate weak greedy algorithms, which, in turn, generalize weak greedy algorithm and thus pure greedy algorithm.
Valiullin Artur R., Valiullin Albert R., Solodov Alexei P.   +2 more
doaj   +1 more source

Greedy Algorithms for Optimal Distribution Approximation

Entropy, 2016
The approximation of a discrete probability distribution t by an M-type distribution p is considered. The approximation error is measured by the informational divergence D ( t ∥ p ) , which is an appropriate measure, e.g., in the ...
Bernhard C. Geiger, Georg Böcherer
doaj   +1 more source

The Feature Compression Algorithms for Identifying Cytokines Based on CNT Features

IEEE Access, 2020
As the signaling proteins, cytokines regulate a wide range of biological functions. It is important to distinguish the cytokines from other kinds of proteins.
Guilin Li, Xing Gao
doaj   +1 more source

Applications of Depth Minimization of Decision Trees Containing Hypotheses for Multiple-Value Decision Tables

Entropy, 2023
In this research, we consider decision trees that incorporate standard queries with one feature per query as well as hypotheses consisting of all features’ values.
Mohammad Azad, Mikhail Moshkov
doaj   +1 more source

Low-Complexity Multi-User Detection Based on Gradient Information for Uplink Grant-Free NOMA

IEEE Access, 2020
Massive machine type communication (mMTC) serves an irreplaceable role in the development process of the Internet of Things (IoT). Because of its characteristics of massive connection and sporadic transmission, compressed sensing (CS) has been applied in
Fang Jiang, Guoliang Zheng, Yanjun Hu, Yi Wang, Yaohua Xu   +4 more
doaj   +1 more source

Distributed Flow Shop Scheduling with Sequence-Dependent Setup Times Using an Improved Iterated Greedy Algorithm

Complex System Modeling and Simulation, 2021
To meet the multi-cooperation production demand of enterprises, the distributed permutation flow shop scheduling problem (DPFSP) has become the frontier research in the field of manufacturing systems. In this paper, we investigate the DPFSP by minimizing
Xue Han, Yuyan Han, Qingda Chen, Junqing Li, Hongyan Sang, Yiping Liu, Quanke Pan, Yusuke Nojima   +7 more
doaj   +1 more source