We investigate the sparse eigenvalue problem which arises in various fields such as machine learning and statistics. Unlike standard approaches relying on approximation of the l0n...
—In the field of distributed computing, there are many round-based algorithms to solve fundamental problems, such as leader election and distributed consensus. Due to the nature...
Image moments have been widely used for designing robust shape descriptors that are invariant to rigid transformations. In this work, we address the problem of estimating non-rigid...
This paper is concerned with nonuniform sampling systems, where the sampling interval is time-varying within a certain known bound. The system is transformed into a time-varying d...
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particul...