Sciweavers

145 search results - page 17 / 29
» Transient Probability Functions: A Sample Path Approach
Sort
View
ACCV
2006
Springer
14 years 3 months ago
Statistical Shape Models Using Elastic-String Representations
Abstract. To develop statistical models for shapes, we utilize an elastic string representation where curves (denoting shapes) can bend and locally stretch (or compress) to optimal...
Anuj Srivastava, Aastha Jain, Shantanu H. Joshi, D...
NIPS
1990
13 years 10 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
14 years 2 months ago
Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution
Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...
Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani
BMCBI
2008
112views more  BMCBI 2008»
13 years 9 months ago
Evaluation of genomic island predictors using a comparative genomics approach
Background: Genomic islands (GIs) are clusters of genes in prokaryotic genomes of probable horizontal origin. GIs are disproportionately associated with microbial adaptations of m...
Morgan G. I. Langille, William W. L. Hsiao, Fiona ...
ESANN
2003
13 years 10 months ago
On Convergence Problems of the EM Algorithm for Finite Gaussian Mixtures
Efficient probability density function estimation is of primary interest in statistics. A popular approach for achieving this is the use of finite Gaussian mixture models. Based on...
Cédric Archambeau, John Aldo Lee, Michel Ve...