Abstract. We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as...
In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is defined via a functor into the category of relations on sets, which ...
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
In local feature?based face recognition systems, the topographical locations of feature extractors directly affect the discriminative power of a recognizer. Better recognition acc...
—We consider the problem of designing a network which minimizes the total cost of the switching facilities and the fiber links, by choosing the subset of nodes at which to insta...