1531 search results - page 88 / 307 » Learning probabilistic models of the Web |
185
click to vote
UAI
2008
15 years 7 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
161
click to vote
AAAI
2010
15 years 7 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
176
click to vote
EMNLP
2010
15 years 4 months ago
2010
This paper addresses the problem of learning to map sentences to logical form, given training data consisting of natural language sentences paired with logical representations of ...
145
click to vote
ICWE
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper, we integrate WebML, a high-level model and technology for building server-side Web applications, with UML-Guide, a UML-based system that generates client-s...
153
click to vote
IJAR
2007
15 years 6 months ago
2007
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...