Because of the growing importance of concurrent programming, many people are trying to figure out where in the curriculum to introduce students to concurrency. In this paper we di...
Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P....
Early in its history as an academic discipline, depth in computer programming was a primary distinguishing factor between IT and older computing disciplines, such as computer scie...
We describe two general approaches to creating document-level maps of science. To create a local map one defines and directly maps a sample of data, such as all literature publish...
This article presents an efficient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set ...
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...