779 search results - page 68 / 156 » Determining Time of Queries for Re-ranking Search Results |
SIBGRAPI
2008
IEEE
14 years 2 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
ICIP
1999
IEEE
14 years 9 months ago
1999
IEEE
Researchers are currently more interested in searching for fragments that are similar to a query, than a total data item that is similar to a query; the search interest is for &qu...
ERCIMDL
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Digital Library support for textual and certain types of nontextual documents has significantly advanced over the last years. While Digital Library support implies many a...
COLCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract. Collaborative search engines (CSE) let users pool their resources and share their experiences when seeking information on the web. However, when shared, search terms and ...