1974 search results - page 125 / 395 » On Unbiased Linear Approximations |
124
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
87
Voted
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the la...
127
click to vote
MFCS
2009
Springer
15 years 5 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
95
Voted
ICCAD
1999
IEEE
15 years 5 months ago
1999
IEEE
Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alte...
105
Voted
COMPGEOM
1995
ACM
15 years 4 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...