A submodular polyhedron is a polyhedron associated with a submodular function. This paper presents a strongly polynomial time algorithm for line search in submodular polyhedra with the aid of a fully combinatorial algorithm for submodular function minimization. The algorithm is based on the parametric search method proposed by Megiddo.

Coexistence The special case when all the independent solutions of a linear, T -periodic ODE are T -periodic. Hill’s equation A second order ODE of the form ẍ + p(t)x = 0, with p(t) T -periodic. Instability pockets Finite domains, usually intersections of instability tongues, where the trivial solution of linear, T -periodic ODEs is unstable. Instability tongues Domains in parameter space where...

In this paper we present a probabilistic formalization of the instance-based learning approach. In our Bayesian framework, moving from the construction of an explicit hypothesis to a data-driven instance-based learning approach, is equivalent to averaging over all the (possibly innnitely many) individual models. The general Bayesian instance-based learning framework described in this paper can ...

1 ABSTRACT We present a discriminant measure that can be used to determine the model complexity in a speech recognition system. In the speech recogition process, given a test feature vector the conditional probability of the feature vector has to be obtained for several al-lophone (sub-phonetic units) classes using a gaussian-mixture density model for each class. The gaussian-mixture models are...

We introduce a powerful non-parametric image labeling framework, Regression Tree Fields (RTFs), and discuss its application to image restoration. The conditional structure and the parameters of our model are estimated from training data so as to directly optimize for popular performance measures, resulting in excellent predictive performance at low computational cost.

In this paper we focus on observability for hybrid systems in the mixed-logic dynamical form. We show that the maximal set of observable states, that is usually non convex and disconnected, can be represented as the union of finitely many polytopic regions. The argument, that is based on multi-parametric programming theory, is constructive and provides an algorithm for the computation of the re...

ABSTRACT In this study, we present a novel method for the topology optimization of irregular flow domain using parametric level set (PLSM). Some improvement was applied on CS-RBFs (radial basis functions with compact support)-based PLSM to make it suitable nonuniform mesh, expanding range field engineering application PLSM. The problem is solved by gradient-based algorithm Stokes equations as s...

It is known that voice quality plays an important role in expressive speech. In this paper, we present a methodology for modifying vocal effort level, which can be applied by text-to-speech (TTS) systems to provide the flexibility needed to improve the naturalness of synthesized speech. This extends previous work using low order Linear Prediction Coefficients (LPC) where the flexibility was con...