Sciweavers

16430 search results - page 445 / 3286
» On Computable Tree Functions
Sort
View
PAMI
2011
15 years 1 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
SGAI
2009
Springer
16 years 1 months ago
From Source Code to Runtime Behaviour: Software Metrics Help to Select the Computer Architecture
The decision which hardware platform to use for a certain application is an important problem in computer architecture. This paper reports on a study where a data-mining approach i...
Frank Eichinger, David Kramer, Klemens Böhm, ...
APL
1995
ACM
15 years 10 months ago
The Role of Composition in Computer Programming
Iverson has greatly enlarged the mathematical notion of function composition and made it available to computer programmers. This paper explains the concept, and uses practical exa...
Donald B. McIntyre
TVCG
2010
162views more  TVCG 2010»
15 years 5 months ago
Computing Robustness and Persistence for Images
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber
ICML
2007
IEEE
16 years 7 months ago
Infinite mixtures of trees
Finite mixtures of tree-structured distributions have been shown to be efficient and effective in modeling multivariate distributions. Using Dirichlet processes, we extend this ap...
Sergey Kirshner, Padhraic Smyth