194 search results - page 32 / 39 » Approximate dynamic programming: Lessons from the field |
UAI
2004
13 years 9 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
JMLR
2010
13 years 2 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
MP
2002
13 years 7 months ago
2002
Abstract. Robust Optimization (RO) is a modeling methodology, combined with computational tools, to process optimization problems in which the data are uncertain and is only known ...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
ensitivity has emerged as an excellent context abstraction for points-to analysis in object-oriented languages. Despite its practical success, however, object-sensitivity is poorl...