Sciweavers

1538 search results - page 27 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
14 years 3 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
ARITH
2007
IEEE
14 years 4 months ago
Spectral Modular Exponentiation
We describe a new method to perform the modular exponentiation operation, i.e., the computation of c = me mod n, where c, m, e and n are large integers. The new method uses the di...
Gökay Saldamli, Çetin Kaya Koç
EMMCVPR
2001
Springer
14 years 2 months ago
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
Endika Bengoetxea, Pedro Larrañaga, Isabell...
ESANN
2007
13 years 11 months ago
Estimation of tangent planes for neighborhood graph correction
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
Karina Zapien Arreola, Gilles Gasso, Stépha...
PAKDD
2007
ACM
152views Data Mining» more  PAKDD 2007»
14 years 4 months ago
Spectral Clustering Based Null Space Linear Discriminant Analysis (SNLDA)
While null space based linear discriminant analysis (NLDA) obtains a good discriminant performance, the ability easily suffers from an implicit assumption of Gaussian model with sa...
Wenxin Yang, Junping Zhang