288 search results - page 6 / 58 » Document generality: its computation for ranking |
WWW
2005
ACM
15 years 10 months ago
2005
ACM
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
67
Voted
WWW
2007
ACM
15 years 10 months ago
2007
ACM
PageRank is known to be an efficient metric for computing general document importance in the Web. While commonly used as a one-size-fits-all measure, the ability to produce topica...
FOSSACS
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
ICMLA
2008
14 years 11 months ago
2008
We have designed a framework for content based appraisal of documents. Our motivation is to provide computer assisted support for answering several appraisal criteria according to...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...