Sciweavers

893 search results - page 43 / 179
» Relational link-based ranking
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 10 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
14 years 5 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman
INEX
2007
Springer
14 years 4 months ago
Integrating Document Features for Entity Ranking
The Knowledge Media Institute of the Open University participated in the entity ranking and entity list completion tasks of the Entity Ranking Track in INEX 2007. In both the entit...
Jianhan Zhu, Dawei Song, Stefan M. Rüger
WADS
2001
Springer
137views Algorithms» more  WADS 2001»
14 years 3 months ago
Visual Ranking of Link Structures
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...
Ulrik Brandes, Sabine Cornelsen
ITA
2006
163views Communications» more  ITA 2006»
13 years 10 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...