A time-optimal solution to a classification problem in ordered functional domains, with applications

✍ Scribed by V. Bokka; S. Olariu; J.L. Schwing; L. Wilson; A. Zomaya

• Book ID: 104161850
• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 804 KB
• Volume: 30
• Category: Article
• ISSN: 0031-3203
• DOI: 10.1016/s0031-3203(96)00151-3

✦ Synopsis

Abstract~onsider 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 v ~ × ~/~. 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 ofm (1 < m < n), point location (i.e. classification) queries can be answered in O(m/x/n) time. As it turns out, this is best possible on this platform. ~'