The application of energy minimisation methods for stereo matching has been demonstrated to produce high quality disparity maps. However, the majority of these methods are known to be computationally expensive requiring minutes of computation. In this paper, we propose a fast minimisation scheme that produces high quality stereo reconstructions for significantly reduced running time, requiring ...

INTRODUCTION This report describes the extent to which 12 workplace aggression prevention and minimisation actions have been implemented in Australian clinical medical practice settings. METHODS Using a cross-sectional, self-report survey conducted as part of a national longitudinal study of the Australian medical workforce, differences in the proportions of medical clinicians reporting the i...

The UK waste strategy is based upon the central concept of the hierarchy of preferable options for the treatment and disposal of waste. Minimisation is placed at the top of the hierarchy and the Government seeks to encourage its uptake by industry and commerce as well as householders. It has been accepted that previous waste management policy and practice have not delivered the hoped for moveme...

This paper presents a continuous-time mathematical formulation for freshwater and wastewater minimisation in multipurpose batch plants with and without a central reusable water storage facility. The minimisation of wastewater is achieved through the exploitation of recycle and reuse opportunities. A superstructure that entails all the possible recycle and reuse possibilities is used as the basi...

In this paper we formulate in general terms an approach to prove strong consistency of the Empirical Risk Minimisation inductive principle applied to the prototype or distance based clustering. This approach was motivated by the Divisive Information-Theoretic Feature Clustering model in probabilistic space with Kullback-Leibler divergence, which may be regarded as a special case within the Clus...

We adapt the Coarsest Partition Reenement algorithm to its computation using the speciic data structures of Binary Decision Diagrams. This allows to generate symbolically the set of equivalence classes of a nite automaton with respect to bisim-ulation, without constructing the automaton itself. These equivalence classes represent of course the (new) states of the canonical minimal automaton bis...

The aim of this work is to provide a general method to minimize the size (number of states) of a model M of an ATL∗ formula. Our approach is founded on the notion of alternating bisimulation: given a model M, it is transformed in a stepwise manner into a new model M’ minimal with respect to bisimulation. The method has been implemented and will be integrated to the prover TATL, that constructiv...

1 Généralités 3 1.1 Problèmes d’optimisation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Restauration/reconstruction d’image par minimisation d’énergie . . . . . . . . . . . . . . 3 1.3 Analyse de la solution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3.1 Existence, éventuellement unicité . . . . . . . . . . . . . . . . . . ...