Given an undirected distance graph G=(V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbersâ€¦ (More)

Let a poset P be called chain-complete when every chain, including the empty chain, has a sup in P. Many authors have investigated properties of posets satisfying some sort of chain-completenessâ€¦ (More)

In this paper we consider the question of how much space is needed to represent a set. Given a finite universe U and some subset V (called the vocabulary), an exact membership tester is a procedureâ€¦ (More)

Given a set, S, of Boolean n-vectors, one can choose k of the n coordinate positions and consider the set of k-vectors which results by keeping only the designated k positions of each vector, i.e.,â€¦ (More)

It is shown that \Â¡/(ri), the size of the free distributive lattice on n generators (which is the number of isotone Boolean functions on subsets of an n element set), satisfies *(")< 2<1+Â°<l0f5â€¦ (More)

This paper describes the Smart Vehicle Screening System, which can be installed into a tollbooth for automated recognition of vehicle license plate information using a photograph of a vehicle. Anâ€¦ (More)

16th Annual Symposium on Foundations of Computerâ€¦

1975

Given partially ordered sets (posets) P and Q, it is often useful to construct maps g:Pâ†’Q which are chain-continuous: least upper bounds (supremums) of nonempty linearly ordered subsets areâ€¦ (More)