394 search results - page 13 / 79 » Computing Minimal Polynomials of Matrices |
140
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...
109
Voted
CORR
2008
Springer
15 years 20 hour ago
2008
Springer
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
107
click to vote
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
102
Voted
DM
2006
15 years 14 days ago
2006
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal tr...
105
Voted
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...