Sciweavers

1969 search results - page 142 / 394
» Financial Theory 1
Sort
View
WADS
2005
Springer
133views Algorithms» more  WADS 2005»
15 years 12 months ago
Heap Building Bounds
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...
Zhentao Li, Bruce A. Reed
HT
2004
ACM
15 years 12 months ago
Navigational hypertext models For physical hypermedia environments
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...
RSCTC
2004
Springer
237views Fuzzy Logic» more  RSCTC 2004»
15 years 11 months ago
An Automated Multi-spectral MRI Segmentation Algorithm Using Approximate Reducts
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...
Sebastian Widz, Kenneth Revett, Dominik Slezak
ECAL
2001
Springer
15 years 11 months ago
Passing the ALife Test: Activity Statistics Classify Evolution in Geb as Unbounded
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...
Alastair Channon
ICIP
1998
IEEE
15 years 10 months ago
Segmentation as a Riemannian Drum Problem
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...
Jayant Shah