Results 21 to 30 of about 305,625 (281)
Proceedings. IEEE International Symposium on Information Theory, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brualdi, Richard A, Pless, Vera S
openaire +1 more source
Effect of Objective Function on Data-Driven Greedy Sparse Sensor Optimization
IEEE Access, 2021 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
Collapsing Superstring Conjecture [PDF]
, 2019 In the Shortest Common Superstring (SCS) problem, one is given a collection of strings, and needs to find a shortest string containing each of them as a substring. SCS admits 2 11/23-approximation in polynomial time (Mucha, SODA\u2713).
Golovnev, Alexander +4 more
core +2 more sources
, 2014 Is it possible to maximize a monotone submodular function faster than the widely used lazy greedy algorithm (also known as accelerated greedy), both in theory and practice?
Badanidiyuru, Ashwinkumar +4 more
core +1 more source
Algorithms, 2021 This paper presents a performance comparison of greedy heuristics for a recent variant of the dominating set problem known as the minimum positive influence dominating set (MPIDS) problem. This APX-hard combinatorial optimization problem has applications
Salim Bouamama, Christian Blum
doaj +1 more source
Info-Greedy sequential adaptive compressed sensing [PDF]
, 2015 We present an information-theoretic framework for sequential adaptive compressed sensing, Info-Greedy Sensing, where measurements are chosen to maximize the extracted information conditioned on the previous measurements.
Braun, Gabor +2 more
core +1 more source
Greedy Palindromic Lengths [PDF]
International Journal of Foundations of Computer Science, 2018 In [A. Frid, S. Puzynina and L. Q. Zamboni, On palindromic factorization of words, Adv. in Appl. Math. 50 (2013) 737–748], it was conjectured that any infinite word whose palindromic lengths of factors are bounded is ultimately periodic. We introduce variants of this conjecture and prove this conjecture when the bound is 2. Especially we introduce left
Bucci, Michelangelo, Richomme, Gwenaël
openaire +3 more sources
Greedy vector quantization [PDF]
, 2014 We investigate the greedy version of the $L^p$-optimal vector quantization problem for an $\mathbb{R}^d$-valued random vector $X\!\in L^p$. We show the existence of a sequence $(a_N)_{N\ge 1}$ such that $a_N$ minimizes $a\mapsto\big \|\min_{1\le i\le N-1}
Luschgy, Harald, Pagès, Gilles
core +4 more sources
Renorming spaces with greedy bases [PDF]
, 2014 We study the problem of improving the greedy constant or the democracy constant of a basis of a Banach space by renorming. We prove that every Banach space with a greedy basis can be renormed, for a given $\vare>0$, so that the basis becomes $(1+\vare ...
Dilworth, S. J. +4 more
core +1 more source
Hyperparameter Optimization Using Successive Halving with Greedy Cross Validation
Algorithms, 2022 Training and evaluating the performance of many competing Artificial Intelligence (AI)/Machine Learning (ML) models can be very time-consuming and expensive.
Daniel S. Soper
doaj +1 more source