147 search results - page 10 / 30 » Partitioning procedure for polynomial optimization |
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
CASC
2007
Springer
14 years 4 months ago
2007
Springer
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
PR
2002
13 years 9 months ago
2002
This paper introduces a novel nonlinear extension of Fisher's classical linear discriminant analysis (FDA) known as high-order Fisher's discriminant analysis (HOFDA). Th...
ACTA
2008
13 years 8 months ago
2008
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
AUTOMATICA
2005
13 years 9 months ago
2005
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...