Abstract

Abstract The paper describes a network implementation of the SUP-INF method for solving sets of inequalities, giving several advantages over previous implementations. The cost of symbolic manipulation is transferred to compile time allowing an increase in speed at run time due to parallel evaluation. Further, allowing iteration in the network improves the competence of the method when working with nonlinear expressions. The network is used to implement a geometric reasoner for a computer vision program and this is shown to meet the general requirements for such a system.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.