779 search results - page 4 / 156 » Determining Time of Queries for Re-ranking Search Results |
WWW
2007
ACM
14 years 7 months ago
2007
ACM
Determining the user intent of Web searches is a difficult problem due to the sparse data available concerning the searcher. In this paper, we examine a method to determine the us...
ISMB
1996
13 years 7 months ago
1996
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
WWW
2008
ACM
14 years 7 months ago
2008
ACM
Most of the search engine optimization techniques attempt to predict users interest by learning from the past information collected from different sources. But, a user's curr...
BMCBI
2004
13 years 6 months ago
2004
Background: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or ...
ESA
1999
Springer
13 years 10 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...