Sciweavers

37 search results - page 4 / 8
» Distinguishability of Locally Finite Trees
Sort
View
113
Voted
JFPLC
2004
14 years 11 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
JMLR
2008
129views more  JMLR 2008»
14 years 9 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
ICPR
2004
IEEE
15 years 10 months ago
Detection of Artificial Structures in Natural-Scene Images Using Dynamic Trees
We seek a framework that addresses localization, detection and recognition of man-made objects in natural-scene images in a unified manner. We propose to model artificial structur...
Michael C. Nechyba, Sinisa Todorovic
JAL
2002
86views more  JAL 2002»
14 years 9 months ago
Exploiting structure in quantified formulas
We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based o...
Richard Edwin Stearns, Harry B. Hunt III
UAI
2000
14 years 11 months ago
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
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...
Arnaud Doucet, Nando de Freitas, Kevin P. Murphy, ...