The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
A method of extracting, classifying and modelling non-rigid shapes from an image sequence is presented. Shapes are approximated by polygons where the number of sides is related to...
As part of an investigation of scalable development techniques for systems written in the JavaTM programming language, the Forest Project is building JP, a prototype distributed pr...
X-ray mapping images of polished sections are classified using two unsupervised clustering algorithms. The methods applied are the k-means algorithm and an extended spectral fuzzy...
Klaus Baggesen Hilger, Allan Aasbjerg Nielsen, Jen...
Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this paper we examine how to learn the structure of a DPN from data. We extend stru...