Browse wiki

From Semantic Portal Wiki

Jump to: navigation, search
Alvaro Graves SemRank Shangguan
Modification dateThis property is a special property in this wiki. 2 October 2008 17:48:57  +
Question asked Computation Complexity Issues. Please note Computation Complexity Issues. Please note that this question may be outside of the scope of this paper (possibly due to space limit. I'm a little interested in the computation complexity of the method proposed in this paper. As we know, response time will be the key to any search engines, and thus the key to ranking algorithms. But it seems to me that the author did not include this part in the paper -the only empirical results presented in this paper were used to prove that the SemRank method works as expected. And also, given the complexity of SemRank, it will be possible for us to figure out whether it scales well or not. figure out whether it scales well or not.
Question asked by Zhenning Shangguan +
Question for the Presentation Alvaro Graves SemRank +
Categories Presentation Questions
hide properties that link here 
  No properties link to this page.
 

 

Enter the name of the page to start browsing from.
Views
Personal tools
Semantic Web Community
Tetherless World constellation
maintenance
Toolbox