: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
Information visualisation systems which generate diagrams representing discrete relational information must consider potential users if they are to be effective. Many algorithms w...
We compare two approaches to Bayesian network inference, called variable elimination (VE) and arc reversal (AR). It is established that VE never requires more space than AR, and n...
Cory J. Butz, Junying Chen, Ken Konkel, Pawan Ling...
Abstract. This paper addresses the problem of finding glass objects in images. Visual cues obtained by combining the systematic distortions in background texture occurring at the b...