| M. Berry, T. Do, and S. Varadhan. Svdpackc (version 1.0) user's guide. Technical Report CS-93-194, University of Tennessee, 1993. |
....collects the cluster representatives from all the servers and invokes the associated ranking method. For VSM, the servers are ranked based on the cosine similarity between their cluster representatives and the query. For LSI, we compute the decomposed cluster vectors using the SVDPACKC package [2] and calculate their cosine similarity with respect to a query. Our goal is to give high ranks to the servers that contain the most relevant documents. To verify the ranking estimated by the directory of services, we generate a standard ranking (denoted STD ) by querying each server with the same ....
M. W. Berry, T. Do, G. W. O'Brien, V. Krishna, and S. Varadhan. SVDPACKC (version 1.0) user's guide. Technical Report CS-93-194, University of Tennessee, October 1993.
No context found.
M. W. Berry et al. SVDPACKC: Version 1.0 User's Guide. Technical Report CS--93--194, University of Tennessee, Knoxville, TN, October 1993.
No context found.
M. Berry, T. Do, and S. Varadhan. Svdpackc (version 1.0) user's guide. Technical Report CS-93-194, University of Tennessee, 1993.
No context found.
M. Berry, T. Do, and S. Varadhan. Svdpackc (version 1.0) user's guide. Technical Report CS-93-194, University of Tennessee, 1993.
No context found.
B. Chazelle et al., The Complexity and decidability of SEPARATION, Technical Report CS-83-34, University of Waterloo (November 1983).
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