Konu "Polynomial approximation" için MF - Makale Koleksiyonu | Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering listeleme
Toplam kayıt 3, listelenen: 1-3
-
Crossing minimization in weighted bipartite graphs
(Elsevier B.V., 2009-12)Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The ... -
Incremental construction of classifier and discriminant ensembles
(Elsevier Science Inc, 2009-04-15)We discuss approaches to incrementally construct an ensemble. The first constructs an ensemble of classifiers choosing a subset from a larger set, and the second constructs an ensemble of discriminants, where a classifier ... -
On the maximum cardinality cut problem in proper interval graphs and related graph classes
(Elsevier B.V., 2022-01-04)Although it has been claimed in two different papers that the maximum cardinality cut problem is polynomial-time solvable for proper interval graphs, both of them turned out to be erroneous. In this work we consider the ...