154 search results - page 6 / 31 » Unsupervised query segmentation using only query logs |
KDD
1998
ACM
13 years 12 months ago
1998
ACM
We apply a well-known Bayesian probabilistic model to textual information retrieval: the classification of documents based on their relevance to a query. This model was previously...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
JCDCG
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
WSDM
2009
ACM
14 years 2 months ago
2009
ACM
Web search queries capture the information need of search engine users. Search engines store these queries in their logs and analyze them to guide their search results. In this wo...