Sciweavers

1700 search results - page 5 / 340
» Combinatorial Pattern Matching
Sort
View
ISNN
2005
Springer
14 years 1 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
14 years 1 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
GBRPR
2005
Springer
14 years 1 months ago
Inside and Outside Within Combinatorial Pyramids
Luc Brun, Walter G. Kropatsch
WALCOM
2008
IEEE
95views Algorithms» more  WALCOM 2008»
13 years 9 months ago
Indexing Circular Patterns
This paper deals with the Circular Pattern Matching Problem (CPM). In CPM, we are interested in pattern matching between the text T and the circular pattern C(P) of a given pattern...
Costas S. Iliopoulos, M. Sohel Rahman