Sciweavers

16430 search results - page 197 / 3286
» On Computable Tree Functions
Sort
View
CIMAGING
2010
165views Hardware» more  CIMAGING 2010»
15 years 4 months ago
Implementation and evaluation of a penalized alternating minimization algorithm for computational DIC microscopy
We present the implementation and evaluation of a penalized alternating minimization (AM) method1 for the computation of a specimen's complex transmittance function (magnitud...
Chrysanthe Preza, Joseph A. O'Sullivan
APVIS
2010
14 years 11 months ago
Visual analysis of high dimensional point clouds using topological landscapes
In this paper, we present a novel three-stage process to visualize the structure of point clouds in arbitrary dimensions. To get insight into the structure and complexity of a dat...
Patrick Oesterling, Christian Heine, Heike Jä...
SAC
2000
ACM
15 years 8 months ago
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
Günther R. Raidl, Bryant A. Julstrom
CHI
2010
ACM
15 years 2 months ago
A comparative evaluation on tree visualization methods for hierarchical structures with large fan-outs
Hierarchical structures with large fan-outs are hard to browse and understand. In the conventional node-link tree visualization, the screen quickly becomes overcrowded as users op...
Hyunjoo Song, Bo Hyoung Kim, Bongshin Lee, Jinwook...
IJAR
2006
98views more  IJAR 2006»
15 years 4 months ago
Inference in hybrid Bayesian networks with mixtures of truncated exponentials
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for solving hybrid Bayesian networks. Any probability density function can be approximated...
Barry R. Cobb, Prakash P. Shenoy