Sciweavers

1826 search results - page 320 / 366
» Using Random Forests in the Structured Language Model
Sort
View
AAAI
2010
14 years 11 months ago
Efficient Lifting for Online Probabilistic Inference
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...
Aniruddh Nath, Pedro Domingos
WWW
2004
ACM
15 years 10 months ago
An xpath-based discourse analysis module for spoken dialogue systems
This paper describes an XPath-based discourse analysis module for Spoken Dialogue Systems that allows the dialogue author to easily manipulate and query both the user input's...
Giuseppe Di Fabbrizio, Charles Lewis
CODES
1999
IEEE
15 years 2 months ago
A flexible code generation framework for the design of application specific programmable processors
This paper introduces a flexible code generation framework dedicated to the design of application specific programmable processors. This tool allows the user to build specific com...
François Charot, Vincent Messé
XSYM
2009
Springer
264views Database» more  XSYM 2009»
15 years 4 months ago
From Entity Relationship to XML Schema: A Graph-Theoretic Approach
Abstract. We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constr...
Massimo Franceschet, Donatella Gubiani, Angelo Mon...
FASE
2010
Springer
15 years 1 months ago
Efficient Runtime Assertion Checking of Assignable Clauses with Datagroups
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...
Hermann Lehner, Peter Müller