نتایج جستجو برای: vanishing constraints

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

2011
Dongsheng Chang Kuanquan Wang Lianqing Wang

In this article, a new method for camera self-calibration is presented. A correspondent matrix can be built by matching the corresponding vanishing points between two images and the proposed method must use at least two of these matrices for calibration. The images are all taken from different orientations in any locations for the same object in space. The vanishing points in the image are the ...

2004
Susanne Fuchs-Seliger

Rational choice when preferences are not required to be transitive and complete has been discussed in the literature for years. In this article transitivity and completeness of the preference relation is also not assumed. It will be shown that nevertheless the existence of a competitive equilibrium can be proven when those properties are replaced by a domination property which allows that there...

2006
Toby Walsh

We present a comprehensive study of the use of value precedence constraints to break value symmetry. We first give a simple encoding of value precedence into ternary constraints that is both efficient and effective at breaking symmetry. We then extend value precedence to deal with a number of generalizations like wreath value and partial interchangeability. We also show that value precedence is...

Journal: :Gastroenterology 2018

Journal: :Nature 1966

Journal: :Transactions of the American Mathematical Society 1959

Journal: :The Iowa Review 1979

Journal: :Ceylon Medical Journal 2011

Journal: :Journal of Cosmology and Astroparticle Physics 2022

Minimally modified gravity is a class of models with only the two tensor degrees freedom as in general relativity. Using framework auxiliary constraints these can maintain dynamical cosmological background. The form thereby restricted by requirement dark energy and avoidance breakdown perturbation theory. Studying linear perturbations around FLRW background results are, however, quite insensiti...

2004
Brahim Hnich Steven David Prestwich Evgeny Selensky

Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our proposed models exploit non-binary (global) constraints, redundant modelling, channelling constraints, and symmetry breaking constraints. Our initial experiments show that with our best integrated model, we are able to eit...

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

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