Sciweavers

4007 search results - page 153 / 802
» Computation with imprecise probabilities
Sort
View
125
Voted
NIPS
2001
15 years 5 months ago
Fast, Large-Scale Transformation-Invariant Clustering
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
Brendan J. Frey, Nebojsa Jojic
146
Voted
BMVC
1998
15 years 5 months ago
Active Object Recognition in Parametric Eigenspace
We present an efficient method within an active vision framework for recognizing objects which are ambiguous from certain viewpoints. The system is allowed to reposition the camer...
Hermann Borotschnig, Lucas Paletta, Manfred Prantl...
132
Voted
CSDA
2010
91views more  CSDA 2010»
15 years 3 months ago
Default Bayesian model determination methods for generalised linear mixed models
In this paper, we consider a default strategy for fully Bayesian model determination for GLMMs. We address the two key issues of default prior specification and computation. In pa...
Antony M. Overstall, Jonathan J. Forster
101
Voted
ICPR
2010
IEEE
15 years 1 months ago
Word Clustering Using PLSA Enhanced with Long Distance Bigrams
Probabilistic latent semantic analysis is enhanced with long distance bigram models in order to improve word clustering. The long distance bigram probabilities and the interpolate...
Nikoletta Bassiou, Constantine Kotropoulos
114
Voted
COR
2011
14 years 10 months ago
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
Jennifer Pryor, John W. Chinneck