We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case[2...
In this paper we identify a common aim between ubiquitous computing and hypertext systems: the desire to present navigable, located and structured information. We propose that exi...
David E. Millard, David De Roure, Danius T. Michae...
Abstract. We introduce an automated multi-spectral MRI segmentation technique based on approximate reducts derived from the data mining paradigm of the theory of rough sets. We uti...
Bedau and Packard’s evolutionary activity statistics [1, 2] are used to classify the evolutionary dynamics in Geb [3, 4], a system designed to verify and extend theories behind t...
1 In this paper, the segmentation problem is formulated as a problem of segmenting a Riemannian manifold. The image domain is endowed with an anisotropic metric and its segmentatio...