Sciweavers

8669 search results - page 146 / 1734
» Computing matrix representations
Sort
View
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 9 months ago
Locally computable approximations for spectral clustering and absorption times of random walks
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos...
ISSAC
2007
Springer
106views Mathematics» more  ISSAC 2007»
14 years 3 months ago
Numerical techniques for computing the inertia of products of matrices of rational numbers
Consider a rational matrix, particularly one whose entries have large numerators and denominators, but which is presented as a product of very sparse matrices with relatively smal...
John P. May, B. David Saunders, David Harlan Wood
GECCO
2010
Springer
165views Optimization» more  GECCO 2010»
13 years 11 months ago
Evolving robust controller parameters using covariance matrix adaptation
In this paper, the advantages of introducing an additional amount of tests when evolving parameters for specific purposes is discussed. A set of optimal PID-controller parameters...
Gerulf K. M. Pedersen, Martin V. Butz
AAAI
2012
11 years 11 months ago
Learning the Kernel Matrix with Low-Rank Multiplicative Shaping
Selecting the optimal kernel is an important and difficult challenge in applying kernel methods to pattern recognition. To address this challenge, multiple kernel learning (MKL) ...
Tomer Levinboim, Fei Sha
TPDS
2008
89views more  TPDS 2008»
13 years 9 months ago
Algorithm-Based Fault Tolerance for Fail-Stop Failures
Fail-stop failures in distributed environments are often tolerated by checkpointing or message logging. In this paper, we show that fail-stop process failures in ScaLAPACK matrix ...
Zizhong Chen, Jack Dongarra