Sciweavers

42 search results - page 2 / 9
» Computing Characteristic Polynomials from Eigenvalues
Sort
View
ISSAC
2009
Springer
150views Mathematics» more  ISSAC 2009»
13 years 12 months ago
On finding multiplicities of characteristic polynomial factors of black-box matrices
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
Jean-Guillaume Dumas, Clément Pernet, B. Da...
ECCV
2006
Springer
14 years 7 months ago
Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
Christian Beder, Wolfgang Förstner
ICASSP
2011
IEEE
12 years 9 months ago
Complex random matrices and multiple-antenna spectrum sensing
In this paper, we study the eigenvalue-based spectrum sensing techniques for multiple-antenna cognitive radio networks. First, we study the extreme eigenvalue distributions of a c...
Tharmalingam Ratnarajah, Caijun Zhong, Ayse Kortun...
ATAL
2011
Springer
12 years 5 months ago
Concise characteristic function representations in coalitional games based on agent types
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Thus, coalitional games, including Coalition Structure Generation (CSG), have been ...
Suguru Ueda, Makoto Kitaki, Atsushi Iwasaki, Makot...
CSL
2010
Springer
13 years 6 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek