166 search results - page 21 / 34 » Extending the Search Strategy in a Query Optimizer |
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
SIGIR
2011
ACM
2011
ACM
Find it if you can: a game for modeling different types of web search success using interaction data
12 years 10 months ago
A better understanding of strategies and behavior of successful searchers is crucial for improving the experience of all searchers. However, research of search behavior has been s...
ICDE
2010
IEEE
14 years 2 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
CIVR
2009
Springer
14 years 1 months ago
2009
Springer
The GIST descriptor has recently received increasing attention in the context of scene recognition. In this paper we evaluate the search accuracy and complexity of the global GIST...
BIOCOMP
2007
13 years 8 months ago
2007
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...