| D10-1110 | engines adopt a fairly involved | ranking algorithm | to order Web search results by |
| A00-2023 | statistical generation . An efficient | ranking algorithm | is described , together with |
| D09-1084 | depends on the search en - gine 's | ranking algorithm | . Although two words X and Y |
| D10-1036 | 1998 ) . PageRank is a well known | ranking algorithm | that uses link information to |
| A00-2023 | be considered . In effect , the | ranking algorithm | exploits the independence that |
| A00-2023 | The forest representation and | ranking algorithm | have been implemented as part |
| A00-2023 | the input to a forest . 3 Forest | ranking algorithm | The algorithm proposed here for |
| A00-2023 | combines with . Pseudocode for the | ranking algorithm | is shown below . " Node " is |
| C04-1162 | network ( WordNet ) with graph-based | ranking algorithms | ( PageRank ) . We compare our |
| D11-1049 | task . Then we review the Path | Ranking Algorithm | ( PRA ) introduced by Lao and |
| D08-1079 | Xiaojun Abstract The graph-based | ranking algorithm | has been recently exploited for |
| D08-1079 | and then applies the graph-based | ranking algorithm | to compute the rank scores for |
| D08-1043 | domain-specific corpora . Specifically , the | ranking algorithm | proceeds as follows . First , |
| C04-1162 | Algorithm Iterative graph-based | ranking algorithms | are essentially a way of deciding |
| A00-2023 | impact on the efficiency of the | ranking algorithm | because the same set of score |
| D08-1079 | incorporated into the graph-based | ranking algorithm | . The experimental results on |
| D08-1043 | as 1 , and the PageRank-based | ranking algorithm | is run on the graph iteratively |
| A00-1036 | above , comparing the relaxation - | ranking algorithm | with document retrieval systems |
| D09-1025 | retrieval measure for evaluating | ranking algorithms | , defined as : AP ( L ) = EILJ1 |
| D09-1025 | rule-based and ML-based knowledge | ranking algorithms | ; and • Model previous |
