779 search results - page 37 / 156 » Determining Time of Queries for Re-ranking Search Results |
WISE
2007
Springer
14 years 1 months ago
2007
Springer
A common search problem in the World Wide Web concerns finding information if it is not known when the sources of information appear and how long sources will be available on the ...
MDM
2010
Springer
13 years 9 months ago
2010
Springer
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
KI
2001
Springer
14 years 2 days ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
SODA
1993
ACM
13 years 9 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
BMCBI
2011
12 years 11 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...