4277 search results - page 194 / 856 » On Multiple Linear Approximations |
148
click to vote
COCOON
2005
Springer
15 years 12 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...
200
click to vote
MFCS
2009
Springer
15 years 11 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...
159
click to vote
ICCAD
1999
IEEE
15 years 10 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...
182
click to vote
COMPGEOM
1995
ACM
15 years 10 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...
181
click to vote
MCS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Stacked generalization is a flexible method for multiple classifier combination; however, it tends to overfit unless the combiner function is sufficiently smooth. Prev...