Results 81 to 90 of about 13,098 (239)
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
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
Hypergraph cuts with edge-dependent vertex weights
We develop a framework for incorporating edge-dependent vertex weights (EDVWs) into the hypergraph minimum s-t cut problem. These weights are able to reflect different importance of vertices within a hyperedge, thus leading to better characterized cut ...
Yu Zhu, Santiago Segarra
doaj +1 more source
Efficient Minimization of Decomposable Submodular Functions [PDF]
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of convex functions, and can be minimized in strongly polynomial time ...
Krause, Andreas, Stobbe, Peter
core +2 more sources
Maximizing k -Submodular Functions and Beyond [PDF]
We consider the maximization problem in the value oracle model of functions defined on k -tuples of sets that are submodular in every orthant and r -wise monotone, where k ⩾ 2 and 1 ⩽ r ⩽ k .
Ward, J, Zivny, S
openaire +3 more sources
Multivariate Incomplete Information in the Mixture Model of Contests
ABSTRACT A general mixture model of contests is introduced, combining stochastic performance and multivariate incomplete information. Performance is determined by a mixture distribution with endogenous weights on a good and bad distribution, respectively.
René Kirkegaard
wiley +1 more source
Polarity related influence maximization in signed social networks. [PDF]
Influence maximization in social networks has been widely studied motivated by applications like spread of ideas or innovations in a network and viral marketing of products.
Dong Li +5 more
doaj +1 more source
Submodular Functions and Perfect Graphs
We give a combinatorial polynomial-time algorithm to find a maximum weight independent set in perfect graphs of bounded degree that do not contain a prism or a hole of length four as an induced subgraph. An even pair in a graph is a pair of vertices all induced paths between which are even.
Tara Abrishami +3 more
openaire +3 more sources
ABSTRACT This study reports the results of a systematic literature review on auctions mechanism. Auctions are a very popular practice employed in many fields but does not exist a research that investigates the use of auctions under a cross‐disciplinary approach. This work is focused on analyzing which are the areas where auctions are mostly adopted and
Alberto Michele Felicetti +3 more
wiley +1 more source
A T2T-Based Offloading Method: Virtual Bank With Movement Prediction
Rapid developments in network technologies and mobile devices improve our lives, but the resultant fast-growing traffic leads to a lack of cellular network resources and breaks the balance between profit and costs for network providers.
Lifeng Mai +3 more
doaj +1 more source

