Sciweavers

4972 search results - page 19 / 995
» Ranking on graph data
Sort
View
AH
2004
Springer
15 years 5 months ago
Using SiteRank for Decentralized Computation of Web Document Ranking
Abstract. The PageRank algorithm demonstrates the significance of the computation of document ranking of general importance or authority in Web information retrieval. However, doi...
Jie Wu, Karl Aberer
ITA
2006
163views Communications» more  ITA 2006»
14 years 11 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...
STACS
2001
Springer
15 years 4 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
SIAMDM
2008
115views more  SIAMDM 2008»
14 years 11 months ago
Rank-Width and Well-Quasi-Ordering
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
Sang-il Oum
ICML
2007
IEEE
16 years 17 days ago
Cluster analysis of heterogeneous rank data
Cluster analysis of ranking data, which occurs in consumer questionnaires, voting forms or other inquiries of preferences, attempts to identify typical groups of rank choices. Emp...
Ludwig M. Busse, Peter Orbanz, Joachim M. Buhmann