Sciweavers

757 search results - page 120 / 152
» Density Estimation in Linear Time
Sort
View
NIPS
2008
13 years 11 months ago
Continuously-adaptive discretization for message-passing algorithms
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Michael Isard, John MacCormick, Kannan Achan
DEDS
2010
88views more  DEDS 2010»
13 years 10 months ago
On the Performance Evaluation of Multi-Guarded Marked Graphs with Single-Server Semantics
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...
Jorge Júlvez, Jordi Cortadella, Michael Kis...
IJAR
2010
152views more  IJAR 2010»
13 years 8 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...
ACCV
2010
Springer
13 years 5 months ago
An Efficient RANSAC for 3D Object Recognition in Noisy and Occluded Scenes
In this paper, we present an efficient algorithm for 3D object recognition in presence of clutter and occlusions in noisy, sparse and unsegmented range data. The method uses a robu...
Chavdar Papazov, Darius Burschka
CACM
2011
120views more  CACM 2011»
13 years 5 months ago
The sequence memoizer
We propose an unbounded-depth, hierarchical, Bayesian nonparametric model for discrete sequence data. This model can be estimated from a single training sequence, yet shares stati...
Frank Wood, Jan Gasthaus, Cédric Archambeau...