779 search results - page 87 / 156 » Determining Time of Queries for Re-ranking Search Results |
193
click to vote
CN
2007
15 years 6 months ago
2007
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
342
click to vote
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
147
click to vote
SIGIR
2005
ACM
15 years 11 months ago
2005
ACM
In this poster we describe alternative inverted index structures that reduce the time required to process queries, produce a higher query throughput and still return high quality ...
142
click to vote
ALMOB
2008
15 years 6 months ago
2008
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
154
click to vote
SIGOPS
2010
15 years 4 months ago
2010
Information management applications exhibit a wide range of query performance and result freshness goals. Some applications, such as web search, require interactive performance, b...