394 search results - page 28 / 79 » Computing Minimal Polynomials of Matrices |
99
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
FPGA
1995
ACM
15 years 4 months ago
1995
ACM
In this paper, we present an improvement of the FlowMap algorithm, named CutMap, which combines depth and area minimization in the mapping process by computing min-cost min-height...
104
Voted
CORR
2010
Springer
15 years 17 days ago
2010
Springer
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We give an algorithm for this problem that has running ...
104
click to vote
AUTOMATICA
2008
15 years 18 days ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
102
Voted
MOBIHOC
2007
ACM
16 years 2 days ago
2007
ACM
Recently, there has been substantial interest in the design of crosslayer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g....