1681 search results - page 42 / 337 » Speeding up keyword search for search engines |
104
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
110
click to vote
CF
2008
ACM
14 years 11 months ago
2008
ACM
String searching is the computationally intensive kernel of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filter...
SIGIR
2009
ACM
15 years 4 months ago
2009
ACM
Query abandonment by search engine users is generally considered to be a negative signal. In this paper, we explore the concept of good abandonment. We define a good abandonment ...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of th...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
Given a terabyte click log, can we build an efficient and effective click model? It is commonly believed that web search click logs are a gold mine for search business, because th...