In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
We describe a neural network which enhances and completes salient closed contours. Our work is different from all previous work in three important ways. First, like the input prov...
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
For any class C und closed under NC1 reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtimeuniform AC0 ) reductions are isomorphic under ...
This paper describes a preliminary investigation into the concept of rereadability in interactive stories. Through a close reading of the text-based interactive fiction Alabaster, ...