447 search results - page 33 / 90 » Re-ranking search results using document-passage graphs |
UAI
2001
14 years 11 months ago
2001
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
192
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
ICWS
2008
IEEE
14 years 11 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
172
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present some techniques for handling planning problems with numerical expressions that can be specified using the standard planning language PDDL. These techniques ar...