18 search results - page 3 / 4 » Efficient Graph Reachability Query Answering Using Tree Deco... |
113
Voted
AAAI
2011
14 years 1 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
232
Voted
ICDE
2009
IEEE
16 years 2 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...
149
Voted
AAAI
2008
15 years 2 months ago
2008
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
120
Voted
SIAMCOMP
2000
15 years 27 days ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
104
Voted
WWW
2008
ACM
16 years 1 months ago
2008
ACM
This paper studies the problem of unified ranked retrieval of heterogeneous XML documents and Web data. We propose an effective search engine called Sailer to adaptively and versa...