Sciweavers

412 search results - page 1 / 83
» Diagonalization
Sort
View
COCO
2003
Springer
85views Algorithms» more  COCO 2003»
13 years 10 months ago
Universal Languages and the Power of Diagonalization
We define and study strong diagonalization and compare it to weak diagonalization, implicit in [7]. Kozen’s result in [7] shows that virtually every separation can be recast as...
Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel
IDA
2009
Springer
13 years 10 months ago
Least Square Joint Diagonalization of Matrices under an Intrinsic Scale Constraint
Abstract. We present a new algorithm for approximate joint diagonalization of several symmetric matrices. While it is based on the classical least squares criterion, a novel intrin...
Dinh-Tuan Pham, Marco Congedo
ICASSP
2008
IEEE
14 years 2 days ago
A fast approximate joint diagonalization algorithm using a criterion with a block diagonal weight matrix
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
Petr Tichavský, Arie Yeredor, Jan Nielsen
UC
2009
Springer
14 years 4 days ago
On the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory
Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the...
Karl Svozil
ICML
2006
IEEE
14 years 6 months ago
Practical solutions to the problem of diagonal dominance in kernel document clustering
In supervised kernel methods, it has been observed that the performance of the SVM classifier is poor in cases where the diagonal entries of the Gram matrix are large relative to ...
Derek Greene, Padraig Cunningham