Sciweavers

1722 search results - page 81 / 345
» On the sample mean of graphs
Sort
View
APVIS
2001
15 years 2 months ago
Building Virtual Worlds with the Big-Bang Model
Visualisations implemented as virtual worlds can allow users to comprehend large graphs more effectively. Good 3D layout algorithms are an important element. Angle has been develo...
Neville Churcher, Alan Creek
AUTOMATICA
2004
91views more  AUTOMATICA 2004»
15 years 14 days ago
Comparing digital implementation via the bilinear and step-invariant transformations
From an analog system K, digital systems Kd and Kbt are often obtained via the step-invariant and bilinear transformations, respectively. For the case when K is stable, it is show...
Guofeng Zhang, Tongwen Chen
93
Voted
WSC
2001
15 years 2 months ago
Reducing input parameter uncertainty for simulations
Parameters of statistical distributions that are input to simulations are typically not known with certainty. For existing systems, or variations on existing systems, they are oft...
Szu Hui Ng, Stephen E. Chick
116
Voted
CAIP
2005
Springer
133views Image Analysis» more  CAIP 2005»
15 years 6 months ago
Finding the Number of Clusters for Nonparametric Segmentation
Non-parametric data representation can be done by means of a potential function. This paper introduces a methodology for finding modes of the potential function. Two different me...
Nikolaos Nasios, Adrian G. Bors
ICASSP
2011
IEEE
14 years 4 months ago
A Bernoulli-Gaussian model for gene factor analysis
This paper investigates a Bayesian model and a Markov chain Monte Carlo (MCMC) algorithm for gene factor analysis. Each sample in the dataset is decomposed as a linear combination...
Cecile Bazot, Nicolas Dobigeon, Jean-Yves Tournere...