Results 31 to 40 of about 87,394 (276)
A SI model for social media influencer maximization
Applied Computing and Informatics, 2019 Social network mining can be divided into two categories, namely, the study of structural characteristics and content analysis. One of the most significant problem in the context of a social network is finding the most influential entities within the ...
Jyoti Sunil More, Chelpa Lingam
doaj +1 more source
Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover [PDF]
, 2013 Stochastic Boolean Function Evaluation is the problem of determining the value of a given Boolean function f on an unknown input x, when each bit of x_i of x can only be determined by paying an associated cost c_i.
Deshpande, Amol +2 more
core +1 more source
Journal of Marine Science and Engineering, 2021 The offshore plant, due to its characteristics, is subject to many restrictions on the material and design of the pipes. Because the design of the firefighting piping depends on the pre-set fire protection design, it is possible to reduce the cost of the
Byeong Cheol Lee +2 more
doaj +1 more source
On a greedy approach for genome scaffolding
Algorithms for Molecular Biology, 2022 Background Scaffolding is a bioinformatics problem aimed at completing the contig assembly process by determining the relative position and orientation of these contigs. It can be seen as a paths and cycles cover problem of a particular graph called the “
Tom Davot +4 more
doaj +1 more source
Greedy MAXCUT Algorithms and their Information Content
, 2016 MAXCUT defines a classical NP-hard problem for graph partitioning and it serves as a typical case of the symmetric non-monotone Unconstrained Submodular Maximization (USM) problem.
Bian, Yatao +2 more
core +1 more source
Revisiting Connected Dominating Sets: An Optimal Local Algorithm? [PDF]
, 2016 In this paper we consider the classical Connected Dominating Set (CDS) problem. Twenty years ago, Guha and Khuller developed two algorithms for this problem - a centralized greedy approach with an approximation guarantee of H(D) +2, and a local greedy ...
Khuller, Samir, Yang, Sheng
core +1 more source
Almost Optimality of the Orthogonal Super Greedy Algorithm for μ-Coherent Dictionaries
Axioms, 2022 We study the approximation capability of the orthogonal super greedy algorithm (OSGA) with respect to μ-coherent dictionaries in Hilbert spaces. We establish the Lebesgue-type inequalities for OSGA, which show that the OSGA provides an almost optimal ...
Chunfang Shao +4 more
doaj +1 more source
Phase transitions for greedy sparse approximation algorithms [PDF]
Applied and Computational Harmonic Analysis, 2011 A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, solutions of underdetermined linear systems of equations. Many such algorithms have now been proven to have optimal-order uniform recovery guarantees using the ubiquitous ...
Blanchard, Jeffrey D. +3 more
openaire +3 more sources
Toward Optimal Placement of Spatial Sensors to Detect Poisson-Distributed Targets
IEEE Access, 2023 This paper addresses the challenges of optimally placing a finite number of sensors to detect Poisson-distributed targets in a bounded domain. We seek to rigorously account for uncertainty in the target arrival model throughout the problem.
Mingyu Kim +5 more
doaj +1 more source
Axioms, 2023 For the purpose of solving elliptic partial differential equations, we suggest a new approach using an h-adaptive local discontinuous Galerkin approximation based on Sinc points.
Omar A. Khalil, Gerd Baumann
doaj +1 more source