Results 21 to 30 of about 43,512 (302)
A Greedy Hypercube-Labeling Algorithm [PDF]
The Computer Journal, 1992 Due to its attractive topological properties, the hypercube multiprocessor has emerged as one of the architectures of choice when it comes to implementing a large number of computational problems. In many such applications, Gray-code labelings of the hypercube are a crucial prerequisite for obtaining efficient algorithms.
Bhagavathi, D. +2 more
openaire +3 more sources
Distributed greedy pursuit algorithms [PDF]
Signal Processing, 2014 For compressed sensing over arbitrarily connected networks, we consider the problem of estimating underlying sparse signals in a distributed manner. We introduce a new signal model that helps to describe inter-signal correlation among connected nodes.
Dennis Sundman +2 more
openaire +2 more sources
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
Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search [PDF]
, 2013 We present an optimal, combinatorial 1−1/e approximation algorithm for monotone submodular optimization over a matroid constraint. Compared to the continuous greedy algorithm (Calinescu, Chekuri, Pál and Vondrák, 2008), our algorithm is extremely simple ...
Filmus, Yuval +3 more
core +1 more source
On the greedy algorithm for satisfiability
Information Processing Letters, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koutsoupias, E, Papadimitriou, C
openaire +3 more sources
Analysis of a Greedy Reconstruction Algorithm [PDF]
SIAM Journal on Control and Optimization, 2021 A novel and detailed convergence analysis is presented for a greedy algorithm that was previously introduced for operator reconstruction problems in the field of quantum mechanics. This algorithm is based on an offline/online decomposition of the reconstruction process and on an ansatz for the unknown operator obtained by an a priori chosen set of ...
Buchwald, Simon +2 more
openaire +3 more sources
On the convergence of the order-preserving weak greedy algorithm for subspaces generated by the Szego kernel in the Hardy space [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2021 In this article we consider representing properties of subspaces generated by the Szego kernel. We examine under which conditions on the sequence of points of the unit disk the order-preserving weak greedy algorithm for appropriate subspaces generated by
Speransky, Konstantin Sergeevich
doaj +1 more source
Journal of Complexity, 2003 A dictionary is a subset \(\mathcal D\) of a Hilbert space \((H,\langle\cdot,\cdot\rangle)\) such that \(\|g\|=1\) for all \(g\in \mathcal D\) and cl-span\((\mathcal D)=H.\) The objective of greedy algorithms is to construct a sequence \(\{g_k\}\) in \(\mathcal D\) and a sequence of approximants \(G_k\in\mathcal D_k=\) span\(\{g_1,\dots,g_k\}\) such ...
Adam Lutoborski, Vladimir N. Temlyakov
openaire +2 more sources
Approximate Weak Greedy Algorithms [PDF]
Advances in Computational Mathematics, 2001 We present a generalization of V. Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries.
Rémi Gribonval, Morten Nielsen 0002
openaire +3 more sources
Quantum-Assisted Greedy Algorithms
IGARSS 2022 - 2022 IEEE International Geoscience and Remote Sensing Symposium, 2022 Proceedings of the International Geoscience and Remote Sensing Symposium (IGARSS)
Ramin Ayanzadeh +3 more
openaire +3 more sources