C.H.A. Koster and Th.P. van der Weide. Hairy Search Trees. The Computer Journal, 38(8):691--694, 1995. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Ranking Strategies for Navigation based Query Formulation - Berger, van Bommel (1996) (1 citation) (Correct)
....i.e. P (f jp) has increased very much by the last action on p. For example we might have the case that the searcher has moved into a part of the hyperindex which terminates in a descriptor without branching off in between. Such a hyperindex might be called a hairy hyperindex (see e.g. [10]) In order to compare a descriptor s increase in target probability we look at the relative increase in target probability. For instance, if descriptor d s target probability rises from 0.1 to 0.15, whereas descriptor e s target probability rises from 0.05 to 0.1, then e has the largest relative ....
C.H.A. Koster and Th.P. van der Weide. Hairy Search Trees. The Computer Journal, 38(8):691--694, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC