Sciweavers

6943 search results - page 363 / 1389
» Representations for evolutionary algorithms
Sort
View
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
15 years 6 months ago
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
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 ...
Louis Ibarra
ICASSP
2011
IEEE
14 years 10 months ago
An unsupervised algorithm for hybrid/morphological signal decomposition
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...
Matthieu Kowalski, Thomas Rodet
ICIP
2004
IEEE
16 years 7 months ago
A novel 2D shape matching algorithm based on B-spline modeling
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...
Yue Wang, Eam Khwang Teoh
152
Voted
ICFCA
2007
Springer
15 years 10 months ago
Performances of Galois Sub-hierarchy-building Algorithms
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...
Gabriela Arévalo, Anne Berry, Marianne Huch...
ICML
2010
IEEE
15 years 7 months ago
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
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...
Ryota Tomioka, Taiji Suzuki, Masashi Sugiyama, His...