Sciweavers

827 search results - page 65 / 166
» The Complexity of Probabilistic Lobbying
Sort
View
ICRA
2009
IEEE
175views Robotics» more  ICRA 2009»
15 years 4 months ago
A combination of particle filtering and deterministic approaches for multiple kernel tracking
Color-based tracking methods have proved to be efficient for their robustness qualities. The drawback of such global representation of an object is the lack of information on its s...
Céline Teuliere, Éric Marchand, Laur...
JMLR
2010
173views more  JMLR 2010»
15 years 1 months ago
Elliptical slice sampling
Many probabilistic models introduce strong dependencies between variables using a latent multivariate Gaussian distribution or a Gaussian process. We present a new Markov chain Mo...
Iain Murray, Ryan Prescott Adams, David J. C. MacK...
ICASSP
2011
IEEE
14 years 10 months ago
Full-covariance UBM and heavy-tailed PLDA in i-vector speaker verification
In this paper, we describe recent progress in i-vector based speaker verification. The use of universal background models (UBM) with full-covariance matrices is suggested and tho...
Pavel Matejka, Ondrej Glembek, Fabio Castaldo, M. ...
ICASSP
2011
IEEE
14 years 10 months ago
Outlier-aware robust clustering
Clustering is a basic task in a variety of machine learning applications. Partitioning a set of input vectors into compact, wellseparated subsets can be severely affected by the p...
Pedro A. Forero, Vassilis Kekatos, Georgios B. Gia...
ICC
2011
IEEE
272views Communications» more  ICC 2011»
14 years 5 months ago
Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
Kavitha Bhaskaran, Joan Triay, Vinod Vokkarane