Results 101 to 110 of about 119,914 (208)
Robust model training and generalisation with Studentising flows [Elektronisk resurs]
Normalising flows are tractable probabilistic models that leverage the power of deep learning to describe a wide parametric family of distributions, all while remaining trainable using maximum likelihood.
Alexanderson, Simon, +1 more
core
Similarities and differences between flow boiling in microchannels and pool boiling
This paper was presented at the 2nd Micro and Nano Flows Conference (MNF2009), which was held at Brunel University, West London, UK. The conference was organised by Brunel University and supported by the Institution of Mechanical Engineers, IPEM, the ...
2nd Micro and Nano Flows Conference (MNF2009) +1 more
core
International capital crunches: the time-varying role of informational asymmetries [PDF]
We examine the determinants of capital flows to four developing countries during the 1990s using an explicitly disequilibrium econometric framework in which the supply and demand for capital are not necessarily equal, and the actual amount of the flow is
Mody, Ashoka, Taylor, Mark P.
core
Nearly Maximum Flows in Nearly Linear Time
We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using α-congestion-approximators: easy-to-compute functions that approximate the congestion required to route single-commodity demands in a graph to within a factor
Jonah Sherman
core +1 more source
Are Chinese Trade Flows Different? [PDF]
We find that Chinese trade flows respond to economic activity and relative prices – as represented by a trade weighted exchange rate – but the relationships are not always precisely or robustly estimated.
Yin-Wong Cheung +2 more
core
Electron firehose instabilities can be excited at dipolarization fronts and in the magnetic reconnection outflow in the terrestrial magnetotail, but their occurrence rate in the plasma sheet is unclear.
Jiayun Wei +8 more
doaj +1 more source
Multi-terminal maximum flows in node-capacitated networks
The problem of finding the maximum flows between each pair of nodes in a subset of k nodes of a node- and arc-capacitated undirected network is studied. Gomory and Hu (1961) showed that in the arc-capacitated case, it suffices to solve only k−1 of the k ...
Granot, Frieda, Hassin, Refael
core +1 more source
Maximum palinstrophy growth in 2D incompressible flows
In this study we investigate the vortex structures which lead to the maximum possible growth of palinstrophy in two-dimensional incompressible flows on a pe-riodic domain.
Diego Ayala, Bartosz Protas
core
Interprovincial migration and the non-linear interaction hypothesis
The aim of this article is to evolve a model explaining with maximum efficiency the migration flows between regions. Because the linear interaction hypothesis is inadequate to this purpose I have made experiments with nonlinear models. Both absolute and
Lauri Hautamäki
doaj
Gentle-Sketch: a high-performance and compact invertible sketch for top-K estimation. [PDF]
Xin Y +5 more
europepmc +1 more source

