Sciweavers

999 search results - page 88 / 200
» Spectral simplex method
Sort
View
UAI
2003
14 years 11 months ago
Learning Generative Models of Similarity Matrices
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
Rómer Rosales, Brendan J. Frey
QEST
2006
IEEE
15 years 4 months ago
Exploring correctness and accuracy of solutions to matrix polynomial equations in queues
Spectral expansion and matrix analytic methods are important solution mechanisms for matrix polynomial equations. These equations are encountered in the steady-state analysis of M...
David Thornley, Harf Zatschler
CIS
2008
Springer
14 years 12 months ago
Discrete Fourier Transform Computation Using Neural Networks
In this paper, a method is introduced how to process the Discrete Fourier Transform (DFT) by a singlelayer neural network with a linear transfer function. By implementing the sugg...
Rosemarie Velik
AAAI
2010
14 years 11 months ago
Smooth Optimization for Effective Multiple Kernel Learning
Multiple Kernel Learning (MKL) can be formulated as a convex-concave minmax optimization problem, whose saddle point corresponds to the optimal solution to MKL. Most MKL methods e...
Zenglin Xu, Rong Jin, Shenghuo Zhu, Michael R. Lyu...
ICALP
2005
Springer
15 years 3 months ago
All Quantum Adversary Methods Are Equivalent
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
Robert Spalek, Mario Szegedy