We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
The main contribution presented here is an adaptive/unsupervised iterative thresholding algorithm for sparse representation of signals which can be modeled as the sum of two compo...
This paper presents a novel algorithm for 2D planar curve recognition based on B-Spline modeling. It combines the advantages of the B-Spline that are continuous curve representati...
Abstract. The Galois Sub-hierarchy (GSH) is a polynomial-size representation of a concept lattice which has been applied to several fields, such as software engineering and linguis...
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...