1088 search results - page 103 / 218 » Probabilistic query expansion using query logs |
COCOON
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
EMNLP
2009
13 years 6 months ago
2009
In this paper we address the problem of identifying a broad range of term variations in Japanese web search queries, where these variations pose a particularly thorny problem due ...
MDM
2004
Springer
14 years 2 months ago
2004
Springer
In this paper, we consider a data model for uncertain trajectories of moving objects. In our model, the trajectory is a vector of uniform stochastic processes. We study “univers...