526 search results - page 89 / 106 » Efficient Algorithms for Online Decision Problems |
121
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
146
click to vote
DM
2006
15 years 4 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
153
click to vote
PAMI
2008
15 years 4 months ago
2008
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
198
click to vote
JMLR
2010
14 years 10 months ago
2010
In this paper, we develop a novel online algorithm based on the Sequential Monte Carlo (SMC) samplers framework for posterior inference in Dirichlet Process Mixtures (DPM) (DelMor...
143
click to vote
UAI
2000
15 years 5 months ago
2000
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...