398 search results - page 12 / 80 » Query by output |
173
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
181
click to vote
ICDE
2003
IEEE
15 years 10 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
CRYPTO
2005
Springer
15 years 3 months ago
2005
Springer
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bit...
CSR
2006
Springer
15 years 1 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...