We show that contour trees can be computed in all dimensions by a simple algorithm that merges two trees. Our algorithm extends, simplifies, and improves work of Tarasov and Vyaly...
The use of amicable sets of eight circulant matrices and four negacyclic matrices to generate orthogonal designs is relatively new. We find all 1841 possible orthogonal designs of...
Wolf H. Holzmann, Hadi Kharaghani, Behruz Tayfeh-R...
Abstract-- We present and explore the effectiveness of several variations on the All-Moves-As-First (AMAF) heuristic in Monte-Carlo Go. Our results show that:
This paper will discuss how the Information Services Client Services group facilitates the support of campus computer labs. It will discuss how one group consisting of three full-...
The neocortex has a remarkably uniform neuronal organization, suggesting that common principles of processing are employed throughout its extent. In particular, the patterns of co...
Ueli Rutishauser, Rodney J. Douglas, Jean-Jacques ...