نتایج جستجو برای: optimal matching analysis

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

Journal: :international journal of epidemiology research 0
philemon manliura datilo mathematical sciences dept., universiti teknologi malaysia, malasia. zuhaimy ismail mathematical sciences dept., universiti teknologi malaysia, malasia.

background and aims: the world is threatened by disease outbreak that reaches a public health emergency of international concern, studies to inform public and agencies for effective containment strategy are necessary. several studies provided vital information of the dynamics and control of ebola epidemic outbreak in west africa. methodologies and techniques in those researches have to be revie...

Journal: :international journal of automotive engineering 0
m.h. shojaeefard s. ebrahimi nejad m. masjedi

in this article, vehicle cornering stability and brake stabilization via bifurcation analysis has been investigated. in order to extract the governing equations of motion, a nonlinear four-wheeled vehicle model with two degrees of freedom has been developed. using the continuation software package matcont a stability analysis based on phase plane analysis and bifurcation of equilibrium is perfo...

2004
David J. Abraham David F. Manlove

We consider Pareto optimal matchings as a means of coping with instances of the Stable Roommates problem (SR) that do not admit a stable matching. Given an instance I of SR, we show that the problem of finding a maximum Pareto optimal matching is solvable in O( √ nα(m,n)m log n) time, where n is the number of agents and m is the total length of the preference lists in I. By contrast we prove th...

2003
Irena Kogan

This paper examines employment careers of immigrants as compared to the native-born in Germany and the United Kingdom, two countries which differ with respect to several factors potentially influencing immigrant integration in the host society and particularly immigration policies, labour market regulation and welfare regimes. To this end the existing longitudinal data from the German Socio-Eco...

Journal: :Neural networks : the official journal of the International Neural Network Society 2016
Hidetoshi Shimodaira

The strength of association between a pair of data vectors is represented by a nonnegative real number, called matching weight. For dimensionality reduction, we consider a linear transformation of data vectors, and define a matching error as the weighted sum of squared distances between transformed vectors with respect to the matching weights. Given data vectors and matching weights, the optima...

2014
Peter C Austin

Propensity-score matching is increasingly being used to reduce the confounding that can occur in observational studies examining the effects of treatments or interventions on outcomes. We used Monte Carlo simulations to examine the following algorithms for forming matched pairs of treated and untreated subjects: optimal matching, greedy nearest neighbor matching without replacement, and greedy ...

Journal: :Image Vision Comput. 2010
James R. Matey Randy P. Broussard Lauren R. Kennell

Iris recognition is well developed and works well for optimal or near-optimal iris images. Dealing with sub-optimal images remains a challenge. Resolution, wavelength, occlusion and gaze are among the most important factors for sub-optimal images. In this paper, we explore the sensitivity of matching to these factors through analysis and numerical simulation, with particular emphasis on the seg...

Journal: :Comput. Lang. 1990
A. Balachandran Dhananjay M. Dhamdhere S. Biswas

Instruction selection is the primary task in automatic code generation. This paper proposes a practical system for performing optimal instruction selection based on tree pattern matching for expression trees. A significant feature of the system is its ability to perform code generation without requiring cost analysis at code generation time. The target machine instructions are specified as attr...

2017
Mohsen Ghaffari

In a recent breakthrough, Paz and Schwartzman [SODA’17] presented a single-pass (2 + ε)approximation algorithm for the maximum weight matching problem in the semi-streaming model. Their algorithm uses O(n log n) bits of space, for any constant ε > 0. In this note, we present a different analysis, for essentially the same algorithm, that improves the space complexity to the optimal bound of O(n ...

Journal: :Communications on Pure and Applied Analysis 2014

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

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