Results 21 to 30 of about 476 (159)
Near-Optimal Convergent Approach for Composed Influence Maximization Problem in Social Networks
Crowd psychology is a critical factor when considering information diffusion, which has been modeled as composed influence. The composed influence is represented as a hyperedge in a graph model.
Jianming Zhu +3 more
doaj +1 more source
Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks
Along with the development of Information Technology, Online Social Networks (OSN) are constantly developing and have become popular media in the world.
Dung V. Pham +4 more
doaj +1 more source
Effect of Objective Function on Data-Driven Greedy Sparse Sensor Optimization
The problem of selecting an optimal set of sensors estimating a high-dimensional data is considered. Objective functions based on D-, A-, and E-optimality criteria of optimal design are adopted to greedy methods, that maximize the determinant, minimize ...
Kumi Nakai +4 more
doaj +1 more source
Parallelizing greedy for submodular set function maximization in matroids and beyond [PDF]
We consider parallel, or low adaptivity, algorithms for submodular function maximization. This line of work was recently initiated by Balkanski and Singer and has already led to several interesting results on the cardinality constraint and explicit packing constraints.
Chandra Chekuri, Kent Quanrud
openaire +2 more sources
Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot
In this paper, we propose an active perception method for recognizing object categories based on the multimodal hierarchical Dirichlet process (MHDP). The MHDP enables a robot to form object categories using multimodal information, e.g., visual, auditory,
Tadahiro Taniguchi +2 more
doaj +1 more source
Maximizing submodular set function with connectivity constraint: Theory and application to networks [PDF]
In this paper, we investigate the wireless network deployment problem, which seeks the best deployment of a given limited number of wireless routers. We found that many goals for network deployment, such as maximizing the number of covered users or areas, or the total throughput of the network, can be modelled with the submodular set function ...
Tung-Wei Kuo +2 more
openaire +2 more sources
Shaping Level Sets with Submodular Functions
We consider a class of sparsity-inducing regularization terms based on submodular functions. While previous work has focused on non-decreasing functions, we explore symmetric submodular functions and their \lova extensions. We show that the Lovasz extension may be seen as the convex envelope of a function that depends on level sets (i.e., the set of ...
openaire +4 more sources
You Can Recharge With Detouring: Optimizing Placement for Roadside Wireless Charger
Wireless energy transfer technologies have played an important role in the development of Internet of Things. Most of the previous studies focus on scheduling mobile chargers efficiently for rechargeable sensor nodes.
Xunpeng Rao +6 more
doaj +1 more source
Submodularity of a Set Label Disagreement Function
A set label disagreement function is defined over the number of variables that deviates from the dominant label. The dominant label is the value assumed by the largest number of variables within a set of binary variables. The submodularity of a certain family of set label disagreement function is discussed in this manuscript. Such disagreement function
openaire +2 more sources
Competitive Influence Maximization ( CIM ) problem, which seeks a seed set nodes of a player or a company to propagate their product’s information while at the same time their competitors are conducting similar strategies, has been paid much ...
Canh V. Pham +3 more
doaj +1 more source

