Abstract
Consider a family C of classifiers represented by continuous functions stored, in discretized form, one function per processor in one column of a mesh with multiple broadcasting of size √ n × √ n In a number of contexts in pattern recognition, morphology, and knowledge engineering applications, it is necessary to answer point location queries with respect to the given classifiers. The main contribution of this work is to show that in such a domain a collection of m (1 ⪕ m ⪕ n), point location (i.e. classification) queries can be answered in Θ( m/ √ m) time. As it turns out, this is best possible on this platform.
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 callDisclaimer: 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.
