404 search results - page 60 / 81 » Answer Extraction |
170
click to vote
SIGMOD
2009
ACM
16 years 2 days ago
2009
ACM
Enabling keyword queries over relational databases (KQDB) benefits a large population of users who have difficulty in understanding the database schema or using SQLs. However, sin...
JAIR
2006
14 years 11 months ago
2006
In this paper we propose a data intensive approach for inferring sentence-internal temporal relations. Temporal inference is relevant for practical NLP applications which either e...
AIPS
2000
15 years 1 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
193
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
We study new hierarchical indexing approach to process XPATH queries. Here, a hierarchical index consists of index entries that are pairs of queries and their (full/partial) answer...
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...