757 search results - page 96 / 152 » Topical query decomposition |
199
click to vote
CORR
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
124
click to vote
SIGMOD
2003
ACM
16 years 4 months ago
2003
ACM
While work in recent years has demonstrated that wavelets can be efficiently used to compress large quantities of data and provide fast and fairly accurate answers to queries, lit...
138
click to vote
WISE
2006
Springer
15 years 10 months ago
2006
Springer
Maintaining a semantic cache of materialized XPath views inside or outside the database, is a novel, feasible and efficient approach to accelerate XML query processing. However, th...
119
click to vote
AAAI
2007
15 years 6 months ago
2007
We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of ...
142
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Hierarchical topic taxonomies have proliferated on the World Wide Web [5, 18], and exploiting the output space decompositions they induce in automated classification systems is an...