نتایج جستجو برای: optimal transportation

تعداد نتایج: 419111  

2014
Oriel Frigo Neus Sabater Vincent Demoulin Pierre Hellier

In this work, a novel and generic method for example-based color transfer is presented. The color transfer is formulated in two steps: first, an example-based Chromatic Adaptation Transform (CAT) has been designed to obtain an illuminant matching between input and example images. Second, the dominant colors of the input and example images are optimally mapped. The main strength of the method co...

A. Mahmoodirad, G. Tohidi H. Hassasi‎ M. Sanei

In the literature hardly any attention is paid to solving a fuzzy fixed charge transportation problem. In this paper, we consider the fully fixed-charge transportation problem and try to find both the lower and upper bounds on the fuzzy optimal value of such a problem in which all of the parameters are triangular fuzzy numbers. To illustrate the proposed method, a numerical example is ‎presented.‎

2003
Vishwesh Kulkarni Sommer Gentry

The problem of designing a decentralized advance hazard warning system for highway transportation systems entails the development of efficient switching controllers. In this paper, we represent the vehicle dynamics by a finite number of modes, each of which is represented by a low order transfer function and a constant time delay. The problem of highway safety analysis then gets translated into...

2012
Alessio Figalli

Optimal mass transportation can be traced back to Gaspard Monge’s famous paper of 1781: ‘Mémoire sur la théorie des déblais et des remblais’. The problem there is to minimize the cost of transporting a given distribution of mass from one location to another. Since then, it has become a classical subject in probability theory, economics and optimization. At the end of the 80’s, the seminal work ...

2005
Yaron Ostrovsky-Berman

We present the first time-optimal algorithm for computing the Voronoi Diagram under the metric induced by a transportation network with discrete entry and exit points. For input with n sites, k stations, and e transportation lines, the algorithm computes the Voronoi Diagram in O ( (n+ k) log(n+ k) + e ) time.

2007
Peter Topping

We introduce the notion of L-optimal transportation, and use it to construct a natural monotonic quantity for Ricci flow which includes a selection of other monotonicity results, including some key discoveries of Perelman [13] (both related to entropy and to L-length) and a recent result of McCann and the author [11].

2017
Nicolas Courty Rémi Flamary Amaury Habrard Alain Rakotomamonjy

This paper deals with the unsupervised domain adaptation problem, where one wants to estimate aprediction function f in a given target domain without any labeled sample by exploiting the knowledgeavailable from a source domain where labels are known. Our work makes the following assumption: thereexists a non-linear transformation between the joint feature/label space distributio...

2004
Alessio Brancolini Giuseppe Buttazzo

In the framework of transport theory, we are interested in the following optimization problem: given the distributions μ of working people and μ− of their working places in an urban area, build a transportation network (such as a railway or an underground system) which minimizes a functional depending on the geometry of the network through a particular cost function. The functional is defined a...

2003
G. Carlier

Following the recent analysis of Lucas and Rossi-Hansberg [10], we study the equilibrium structure of cities. By adopting a different (monetary) specification of commuting costs, we are able to prove the existence of equilibrium in more general situations: non-circular cities, or multi-sectorial production. The main mathematical tool in this paper is the use of optimal transportation theory. Th...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید