Sciweavers

1080 search results - page 93 / 216
» The Complexity of Belief Update
Sort
View
KBS
2011
81views more  KBS 2011»
15 years 1 months ago
Existential rigidity and many modalities in order-sorted logic
Order-sorted logic is a useful tool for knowledge representation and reasoning because it enables representation of sorted terms and formulas along with partially ordered sorts (c...
Ken Kaneiwa
JMLR
2010
146views more  JMLR 2010»
15 years 1 months ago
Nonparametric Tree Graphical Models
We introduce a nonparametric representation for graphical model on trees which expresses marginals as Hilbert space embeddings and conditionals as embedding operators. This formul...
Le Song, Arthur Gretton, Carlos Guestrin
WG
2009
Springer
16 years 28 days ago
Fully Dynamic Representations of Interval Graphs
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
Christophe Crespelle
ISNN
2004
Springer
15 years 11 months ago
Sparse Bayesian Learning Based on an Efficient Subset Selection
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
Liefeng Bo, Ling Wang, Licheng Jiao
SIGDIAL
2011
175views Education» more  SIGDIAL 2011»
14 years 9 months ago
Multi-Policy Dialogue Management
We present a new approach to dialogue management based on the use of multiple, interconnected policies. Instead of capturing the complexity of the interaction in a single large po...
Pierre Lison