نتایج جستجو برای: reduce

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

Journal: :SSRN Electronic Journal 2014

Journal: :Journal of Natural Language Processing 2011

Journal: :Journal of Symbolic Computation 1989

Journal: :SSRN Electronic Journal 2008

2012
Kurt R. Brekke Luigi Siciliani Odd Rune Straume

We study the effect of competition on quality in markets such as health care, long-term care and education, when providers choose both prices and quality in a setting of spatial competition. We offer a novel mechanism whereby competition leads to lower quality. This mechanism relies on two key assumptions, namely that the providers are motivated and riskaverse. Our proposed mechanism can help e...

Journal: :CoRR 2016
Haoyu Song Jun Gong Hongfei Chen

Networking data analytics is increasingly used for enhanced network visibility and controllability. We draw the similarities between the Software Defined Networking (SDN) architecture and the MapReduce programming model. Inspired by the similarity, we suggest the necessary data plane innovations to make network data plane devices function as distributed mappers and optionally, reducers. A strea...

Journal: :CoRR 2015
Qi Li

This paper describes how to convert a machine learning problem into a series of map-reduce tasks. We study logistic regression algorithm. In logistic regression algorithm, it is assumed that samples are independent and each sample is assigned a probability. Parameters are obtained by maxmizing the product of all sample probabilities. Rapid expansion of training samples brings challenges to mach...

Journal: :Journal of epidemiology and community health 2000
A Woodward I Kawachi

It is well known that social, cultural and economic factors cause substantial inequalities in health. Should we strive to achieve a more even share of good health, beyond improving the average health status of the population? We examine four arguments for the reduction of health inequalities.1 Inequalities are unfair. Inequalities in health are undesirable to the extent that they are unfair, or...

1991
Henry S. Thompson Michael Dixon John Lamping

Two new parsing algorithms for context-free phrase structure grammars are presented which perform a bounded amount of processing per word per analysis path, independently of sentence length. They are thus capable of parsing in real-time in a parallel implementation which forks processors in response to non-determinis-tic choice points. 0. INTRODUCTION The work reported here grew out of our atte...

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

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