Results 81 to 90 of about 12,182 (176)

Discretised sum‐product theorems by Shannon‐type inequalities

Journal of the London Mathematical Society, Volume 112, Issue 6, December 2025.
Abstract By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if A⊂[1,2]$A \subset [1,2]$ is a (δ,σ)$(\delta,\sigma)$‐set, with |A|=δ−σ$|A| = \delta ^{-\sigma }$, then A+A$A+A$ or AA$AA$ has δ$\delta$‐covering number at least δ−c|A|$\delta ^{-c}|A|$ for ...
András Máthé, William O'Regan
wiley   +1 more source

Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks

IEEE Access, 2020
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, Giang L. Nguyen, Tu N. Nguyen, Canh V. Pham, Anh V. Nguyen   +4 more
doaj   +1 more source

Polarity related influence maximization in signed social networks. [PDF]

PLoS ONE, 2014
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, Zhi-Ming Xu, Nilanjan Chakraborty, Anika Gupta, Katia Sycara, Sheng Li   +5 more
doaj   +1 more source

Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas

, 2015
We investigate the approximability of several classes of real-valued functions by functions of a small number of variables ({\em juntas}). Our main results are tight bounds on the number of variables required to approximate a function $f:\{0,1\}^n ...
Feldman, Vitaly, Vondrak, Jan
core   +1 more source

Submodular Functions and Perfect Graphs

Mathematics of Operations Research
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, Maria Chudnovsky, Cemil Dibek, Kristina Vušković   +3 more
openaire   +3 more sources

Does Twin Transition Facilitate Exporting? The Case of Logistics Innovation

Business Strategy and the Environment, Volume 34, Issue 7, Page 8194-8212, November 2025.
ABSTRACT Firms need to overcome two hurdles to enter foreign markets: deciding whether to export and the intensity of their export sales. Although logistics plays a crucial role in exporting, the link between logistics innovation and exporting remains unexplored.
Areti Gkypali, Kostas Tsekouras, Andriana G. Dimakopoulou   +2 more
wiley   +1 more source

A T2T-Based Offloading Method: Virtual Bank With Movement Prediction

IEEE Access, 2018
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, Daru Pan, Hui Song, Chen Wang   +3 more
doaj   +1 more source

Approximating Submodular Functions Everywhere [PDF]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
URL to paper from conference site ; Submodular functions are a key concept in combinatorial optimization. Algorithms that involve submodular functions usually assume that they are given by a (value) oracle. Many interesting problems involving submodular functions can be solved using only polynomially many queries to the oracle, e.g., exact minimization
Goemans, Michel X., Harvey, Nicholas J. A., Iwata, Satoru, Mirrokni, Vahab   +3 more
openaire   +1 more source

Target Return Strategy

Financial Review, Volume 60, Issue 4, Page 1483-1503, November 2025.
ABSTRACT We study the target return strategy (TRS), which exits the market once the return reaches a preset target. We show that the holding‐period return (HPR) cannot mean‐variance dominate TRS, but TRS can mean‐variance dominate HPR. We theoretically analyze TRS and quantitatively illustrate that training targets by a mean‐variance utility ...
Ying Xue, Zheng Wen, Xu Jiang
wiley   +1 more source

Efficient Minimization of Decomposable Submodular Functions [PDF]

, 2010
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