Approximate and Stochastic Greedy Optimization
CoRR, 2017 15 ...
Nan Ye, Peter L. Bartlett
openaire +2 more sources
Sparse approximation using new greedy-like bases in superreflexive spaces
, 2022 This paper is devoted to theoretical aspects on optimality of sparse approximation. We undertake a quantitative study of new types of greedy-like bases that have recently arisen in the context of nonlinear $m$-term approximation in Banach spaces as a ...
Albiac, Fernando +6 more
core +1 more source
Bit-filling algorithm for fast subcarrier-selecting in ultrasonic through-metal communication
Tongxin xuebao, 2020 Aiming at the high complexity of the greedy bit-filling algorithm,a bit-filling algorithm for fast subcarrier-selecting used in ultrasonic through-metal communication was proposed.The approximate expression for the BER increment,which was used as the ...
Linsen XU +3 more
doaj +2 more sources
A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph
Algorithms, 2020 We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm, the recent Linear programming (LP) rounding algorithms and a hybrid ...
Jonathan Li +2 more
doaj +1 more source
Hardness of submodular cost allocation : lattice matching and a simplex coloring conjecture [PDF]
, 2014 We consider the Minimum Submodular Cost Allocation (MSCA) problem. In this problem, we are given k submodular cost functions f1, ... , fk: 2V -> R+ and the goal is to partition V into k sets A1, ..., Ak so as to minimize the total cost sumi = 1,k fi(Ai).
Vondrák, Jan, Ene, Alina
core +1 more source
Ultimate greedy approximation of independent sets in subcubic graphs [PDF]
, 2020 We study the approximability of the maximum size independent set (MIS) problem in bounded degree graphs. This is one of the most classic and widely studied NP-hard optimization problems. It is known for its inherent hardness of approximation.
Mathieu Mari +5 more
core +1 more source
Lebesgue-Type Inequalities for Quasi-greedy Bases [PDF]
, 2013 The final publication is available at Springer via http://dx.doi.org/10.1007/s00365-013-9209-zWe show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N-term ...
Oikhberg, Timur +2 more
core +1 more source
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
Learning Incoherent Dictionaries for Sparse Approximation Using Iterative Projections and Rotations [PDF]
, 2013 Copyright 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating ...
Barchiesi, D +3 more
core +1 more source
Approximate greedy clustering and distance selection for graph metrics
Journal of Computational Geometry, 2020 In this paper, we consider two important problems defined on finite metric spaces, and provide efficient new algorithms and approximation schemes for these problems on inputs given as graph shortest path metrics or high-dimensional Euclidean metrics ...
David Eppstein +2 more
doaj +1 more source