نتایج جستجو برای: concave function

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

2003
Bin Zhang Sargur N. Srihari

Analysis of allographs (characters) and allograph combinations (words) is the key for obtaining the discriminating elements of handwriting. While allographs usually inhabit in words and segregation of a word into allographs is more subjective than objective, especially for cursive writing, analysis of handwritten words is a natural and better option. In this study, a handwritten word image is c...

Journal: :Australasian J. Combinatorics 2014
Patrick Bahls Elizabeth Bailey McCabe Olsen

We describe an inductive means of constructing infinite families of graphs, every one of whose members G has independence polynomial I(G; x) having only real zeros. Consequently, such independence polynomials are logarithmically concave and unimodal.

Journal: :IGTR 2002
Sjur Didrik Flåm

Considered here are equilibria, notably those that solve noncooperative games. Focus is on connections between evolutionary stability, concavity and monotonicity. It is shown that evolutionary stable points are local attractors under gradient dynamics. Such dynamics, while reflecting search for individual improvement, can incorporate myopia, imperfect knowledge and bounded rationality/competence.

Journal: :J. Economic Theory 2000
Lars J. Olson Santanu Roy

We examine the efficiency of conservation of a renewable resource whose natural productivity is influenced by random environmental disturbances. We allow for non-concave biological production and stock-dependent social welfare. Unlike deterministic models, conservation may be inefficient no matter how productive the resource growth function is. In addition, improvements in the natural productiv...

2012
Rikke Gade Anders Jørgensen Thomas B. Moeslund

This paper presents a system for automatic analysis of the occupancy of sports arenas. By using a thermal camera for image capturing the number of persons and their location on the court are found without violating any privacy issues. The images are binarised with an automatic threshold method. Reflections due to shiny surfaces are eliminated by analysing symmetric patterns. Occlusions are deal...

2004
C.-H. Ko B. Y. Shew C. K. Lo C. C. Lui M. C. Liang L. G. Sheu C. M. Chen S. F. Cheng

1 Graduate School of Electro-Optical Engineering, Yuan Ze University, Chung-Li, Tao-Yuan 320, Taiwan, R.O.C. 2 National Synchrotron Radiation Research Center, Hsinchu, Taiwan, R.O.C. 3 Department of Electro-Optical Engineering, Vanung University, Chung-Li , Tao-Yuan 32045, Taiwan, R.O.C. a [email protected]; b [email protected]; c [email protected]; d [email protected]; e row...

Journal: :Pattern Recognition Letters 1994
T. T. E. Yeo X. C. Jin Sim Heng Ong Jayasooriah R. Sinniah

We present a novel method of decomposing digital binary clumps into constituent convex parts. The algorithm is based on the analysis of concavities to determine where splitting should occur. Two relative concavity measures, concavity degree and concavity weight, are also defined.

Journal: :J. Economic Theory 2010
Laurens Cherchye Bram De Rock Frederic Vermeulen

An Afriat Theorem for the Collective Model of Household Consumption We provide a nonparametric ‘revealed preference’ characterization of rational household behavior in terms of the collective consumption model, while accounting for general (possibly non-convex) individual preferences. We establish a Collective Axiom of Revealed Preference (CARP), which provides a necessary and sufficient condit...

1996
Shandelle M. Henson J. M. Cushing

Hierarchical structured models for scramble and contest intraspecific competition are derived. The dynamical consequences of the two modes of competition are studied under the assumption that both populations divide up the same amount of a limiting resource at equal population levels. A comparison of equilibrium levels and their resiliences is made in order to determine which mode of competitio...

2015
Alexandre Belloni Tengyuan Liang Hariharan Narayanan Alexander Rakhlin

We consider the problem of optimizing an approximately convex function over a bounded convex set in Rn using only function evaluations. The problem is reduced to sampling from an approximately log-concave distribution using the Hit-and-Run method, which is shown to have the same O∗ complexity as sampling from log-concave distributions. In addition to extend the analysis for log-concave distribu...

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

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