We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
The 1 norm regularized least square technique has been proposed as an efficient method to calculate sparse solutions. However, the choice of the regularization parameter is still...
— Hyper-heuristics or “heuristics that coordinate heuristics” are fastly becoming popular for solving combinatorial optimisation problems. These methods do not search directl...
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping N...
In this work we propose a model for video scenes that contain temporal variability in shape and appearance. We propose a conditionally linear model akin to a dynamic extension of ...