Sciweavers

4604 search results - page 645 / 921
» Correlation-based Data Representation
Sort
View
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
15 years 8 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
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...
James Allen Fill, Svante Janson
BMVC
1998
15 years 8 months ago
Building Shape Models from Image Sequences using Piecewise Linear Approximation
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...
Derek R. Magee, Roger D. Boyle
SCM
1998
15 years 8 months ago
Coordinated Editing of Versioned Packages in the JP Programming Environment
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...
Michael L. Van de Vanter
MVA
2000
122views Computer Vision» more  MVA 2000»
15 years 8 months ago
Unsupervised Classification of X-Ray Mapping Images of Polished Sections
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...
UAI
1998
15 years 8 months ago
Learning the Structure of Dynamic Probabilistic Networks
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...
Nir Friedman, Kevin P. Murphy, Stuart J. Russell