The Institute of Mathematics of the Romanian Academy, seeks a scientist with interest in convex optimization with sub-modular functions (or non-sub-modular generalizations), as well as applications in imaging, machine learning, and artificial intelligence: inference in multi-label Markov random fields with high-order dependencies, with emphasis on developing scalable methods in the number of parameters and datasize, as well as Markov decision problems. The ideal candidate would have a relatively recent doctorate degree or equivalent, an excellent publication record, as well as experience and major interests in the area of discrete and/or continuous optimization with large-scale emphasis (programming options in Matlab or C/C++). The candidate must have the interest and the motivation to work full time (or nearly so) within interdisciplinary high-profile teams that would develop mathematical models, theoretical results, algorithms and prototypes in the area of image analysis, or the computational modeling of intelligence (dynamical systems, variational methods and partial differential equations, control). Good communication and team cooperation skills are very much appreciated. The salaries are competitive; the laboratory has excellent computing infrastructure; it is possible to be engaged in high-profile international collaborations and it is also possible to participate in conferences and international scientific venues. Interested applicants with a strong scientific record are invited to send a CV and a statement of research interests, together with the names and academic address of two referees who can be contacted for recommendation letters (do not send letters directly as the institute will require them only if appropriate).
為防止簡(jiǎn)歷投遞丟失請(qǐng)抄送一份至：boshijob@126.com（郵件標(biāo)題格式：應(yīng)聘職位名稱(chēng)+姓名+學(xué)歷+專(zhuān)業(yè)+中國(guó)博士人才網(wǎng)）
中國(guó)-博士人才網(wǎng)發(fā)布
聲明提示：凡本網(wǎng)注明“來(lái)源：XXX”的文/圖等稿件，本網(wǎng)轉(zhuǎn)載出于傳遞更多信息及方便產(chǎn)業(yè)探討之目的，并不意味著本站贊同其觀點(diǎn)或證實(shí)其內(nèi)容的真實(shí)性，文章內(nèi)容僅供參考。
