3652 search results - page 263 / 731 » A study of query length |
223
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
207
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
341
click to vote
SIGMOD
2006
ACM
16 years 3 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
147
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Understanding intents from search queries can improve a user’s search experience and boost a site’s advertising profits. Query tagging via statistical sequential labeling mode...
124
click to vote
SIGIR
2009
ACM
15 years 10 months ago
2009
ACM
Pseudo-relevance feedback (PRF) via query-expansion has been proven to be effective in many information retrieval (IR) tasks. In most existing work, the top-ranked documents from...