7868 search results - page 255 / 1574 » Learning by Answer Sets |
261
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
209
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
169
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de�...
183
click to vote
DOCENG
2009
ACM
16 years 1 months ago
2009
ACM
In order to evaluate the performance of information retrieval and extraction algorithms, we need test collections. A test collection consists of a set of documents, a clearly form...
159
click to vote
GECCO
2007
Springer
16 years 20 days ago
2007
Springer
Considering the available body of literature on continuous EDAs, one must state that many important questions are still unanswered, e.g.: How do continuous EDAs really work, and h...