YURTSEVEN.ORG is completely for sale, including entire Databases and Domainname.    Price: USD 49.900,-    Phone: +49(176)74919078
     
     
Yurtseven.ORG
 Yurtseven.ORG
     
HOME Software Software Information Retrieval Information Retrieval Ranking Ranking By Context By Context
 
Sort by Sort by          Date Sort by       Alphabetical Sort by

Showing  20 - 27  of total  27  results  [ 0.185  seconds ]  


 
   
  07-January-2012 
Given a typical user query to find quality documents related to the query topic. It uses an Hits variation.



 
   
  07-January-2012 
A survey on PageRank, Hits and SALSA. It also describes two Bayesian statistical algorithms for ranking of hyperlinked documents and the concepts of monotonicity and locality, as well as various concepts of distance and similarity between ranking algo...



 
   
  07-January-2012 
A paper about the computation of PageRank using the standard Power Method and the new Quadratic Extrapolation which computes the principal eigenvector of the Markov matrix representing the Web link graph with an increased speed up of about 50-300%.



 
   
  07-January-2012 
This paper describes a prototype system, later known as the Teoma Search Engine. It performs a Link Analysis, loosely based on the Kleimberg method, and computed at query time.



 
   
  07-January-2012 
HITs is a link-structure analysis algorithm which ranks pages by "authorities" (pages which have many incoming links and provide the best source of information on a given topic) and "hubs" (pages which have many outgoing links and provide useful lists...



 
   
  07-January-2012 
A good explanation about the convergence of various algorithms. This paper also describes an adaptive and on-line algorithm for computing the page importance. It can be used for focus crawling as well as for search engine's ranking.



 
   
  07-January-2012 
Paper by Minhua Wang describing an improvement to Kleimberg's algorithm.


« Previous  1  2  3  


Easy Web Admin


Add URL  |  My Sites  |  My Account  |  Login  |  Contact Us