207 search results - page 11 / 42 » The Polynomial Method for Random Matrices |
ICDM
2005
IEEE
14 years 2 months ago
2005
IEEE
The most suitable method for the automated classification of protein structures remains an open problem in computational biology. In order to classify a protein structure with an...
IJCAI
2007
13 years 10 months ago
2007
A matrix formulation for an adaptive genetic algorithm is developed using mutation matrix and crossover matrix. Selection, mutation, and crossover are all parameter-free in the se...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...
AAAI
2008
13 years 10 months ago
2008
Most manifold learning methods consider only one similarity matrix to induce a low-dimensional manifold embedded in data space. In practice, however, we often use multiple sensors...
ICPPW
2006
IEEE
14 years 2 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...