نتایج جستجو برای: definite problem

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

2008
I-Chien Liu Lun-Wei Ku Kuang-hua Chen Hsin-Hsi Chen

This paper presents an information retrieval system for the NTCIR-7 information retrieval for question answering task. This system is composed by three parts: (1) Query processing (2) Retrieval model (3) Re-rank module. Query processing filters stop-words and selects query terms to generate a required term set for further retrieval. Threes retrieval models from two famous retrieval systems are ...

1985
Mark Johnson

By generalizing the notion of location of a constituent to allow discontinuous Ioctaions, one can describe the discontinuous constituents of non-configurational languages. These discontinuous constituents can be described by a variant of definite clause grammars, and these grammars can be used in conjunction with a proof procedure to create a parser for non-configurational languages.

Journal: :Notre Dame Journal of Formal Logic 1986

Journal: :Journal of Differential Geometry 1988

2002
Bertrand Russell

The theory of definite descriptions Bertrand Russell presented in “On Denoting” one hundred years ago was instrumental in defining the then newly emerging philosophy of language, but a more remarkable achievement is that this centenarian theory is the currently dominant theory of definite descriptions. But what, ex actly, is this theory? The question needs to be asked because the theory Russell...

Journal: :Michigan Mathematical Journal 1957

Journal: :Mathematische Annalen 1912

We consider a fractional program with both linear and quadratic equation in numerator and denominator  having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a  second order cone programming (SOCP)  problem.  For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...

Journal: :Annual Meeting of the Berkeley Linguistics Society 2007

Journal: :Numerical Algebra, Control and Optimization 2023

An orthonormal basis matrix $ X of a subspace {\mathcal X} is known not to be unique, unless there are some kinds normalization requirements. One them require that X^{ \text{T}}D positive semi-definite, where D constant apt size. It natural one in multi-view learning models which serves as projection and determined by maximization problem over the Stiefel manifold whose objective function conta...

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

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