Results 1 to 10 of about 87,603 (273)
Algorithms, 2022 An accelerated least-squares approach is introduced in this work by incorporating a greedy point selection method with randomized singular value decomposition (rSVD) to reduce the computational complexity of missing data reconstruction.
Siriwan Intawichai, Saifon Chaturantabut
doaj +1 more source
Approximate and Stochastic Greedy Optimization
, 2017 15 ...
Ye, Nan, Bartlett, Peter
openaire +2 more sources
Simultaneous sparse approximation via greedy pursuit [PDF]
Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005., 2006 A simple sparse approximation problem requests an approximation of a given input signal as a linear combination of T elementary signals drawn from a large, linearly dependent collection. An important generalization is simultaneous sparse approximation.
Tropp, J. A. +2 more
openaire +2 more sources
RSU deployment planning based on approximation algorithm in urban VANET
Tongxin xuebao, 2018 To minimize the number of RSU deployed to cover a specific area,a c street model transforming the area covering problem to streets covering problem was designed,and a greedy-based polynomial (GBP) time approximation algorithm was developed to obtain the ...
Junyu ZHU +4 more
doaj +2 more sources
, 2019 We show the potential of greedy recovery strategies for the sparse approximation of multivariate functions from a small dataset of pointwise evaluations by considering an extension of the orthogonal matching pursuit to the setting of weighted sparsity ...
A Chkifa +10 more
core +1 more source
A note on 1-semi-greedy bases in p-Banach spaces with 0 < p ≤ 1
Demonstratio MathematicaThe purpose of this article is to discuss about the so-called semi-greedy bases in pp-Banach spaces. Specifically, we will review existing results that characterize these bases in terms of almost-greedy bases, and, also, we analyze quantitatively the ...
Berná Pablo M. +2 more
doaj +1 more source
A Robust Seating Arrangement for Future Pandemics
IEEE AccessNumerous studies have examined classroom seating arrangements to enhance student safety and resource utilization during COVID-19. These studies typically aimed to maximize the minimum distance between students for a given number of students to be ...
Gokhan Karakose, Bayram Dundar
doaj +1 more source
A new greedy search method for the design of digital IIR filter
Journal of King Saud University: Computer and Information Sciences, 2015 A new greedy search method is applied in this paper to design the optimal digital infinite impulse response (IIR) filter. The greedy search method is based on binary successive approximation (BSA) and evolutionary search (ES). The suggested greedy search
Ranjit Kaur +2 more
doaj +1 more source
Step-Size Decay and Structural Stagnation in Greedy Sparse Learning
MathematicsGreedy algorithms are central to sparse approximation and stage-wise learning methods such as matching pursuit and boosting. It is known that the Power-Relaxed Greedy Algorithm with step sizes m−α may fail to converge when α>1 in general Hilbert spaces ...
Pablo M. Berná
doaj +1 more source
Improved sparse approximation over quasi-incoherent dictionaries [PDF]
, 2003 This paper discusses a new greedy algorithm for solving the sparse approximation problem over quasi-incoherent dictionaries. These dictionaries consist of waveforms that are uncorrelated "on average," and they provide a natural generalization of ...
Gilbert, A. C. +3 more
core