Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
Bradford John Larsen, Ethan Burns, Wheeler Ruml, R...
Customer satisfaction with regard to user interfaces becomes increasingly more important and is, eventually, decisive for the selection of systems within a competitive market. End...
Abstract. A major problem of segmentation of magnetic resonance images is that intensities are not standardized like in computed tomography. This article deals with the correction ...
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...