Sciweavers

4542 search results - page 520 / 909
» Design patterns for data structures
Sort
View
184
Voted
EMMCVPR
1997
Springer
15 years 11 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
3DIM
2003
IEEE
15 years 10 months ago
Efficient Surface Reconstruction from Range Curves
This paper proposes an approach for surface reconstruction of free-form rigid objects from an arbitrary set of intersecting range curves. A strategy for updating the reconstructed...
Dragan Tubic, Patrick Hébert, Denis Laurend...
BMCBI
2008
108views more  BMCBI 2008»
15 years 6 months ago
Empirical methods for controlling false positives and estimating confidence in ChIP-Seq peaks
Background: High throughput signature sequencing holds many promises, one of which is the ready identification of in vivo transcription factor binding sites, histone modifications...
David A. Nix, Samir J. Courdy, Kenneth M. Boucher
CGF
2008
165views more  CGF 2008»
15 years 6 months ago
Visual Inspection of Multivariate Graphs
Most graph visualization techniques focus on the structure of graphs and do not offer support for dealing with node attributes and edge labels. To enable users to detect relations...
A. Johannes Pretorius, Jarke J. van Wijk
ISCI
2008
116views more  ISCI 2008»
15 years 6 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu