Sciweavers

2463 search results - page 72 / 493
» Rankings of Directed Graphs
Sort
View
MP
2006
81views more  MP 2006»
13 years 9 months ago
Almost all webs are not rank-perfect
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
Arnaud Pêcher, Annegret Wagler
WIDM
2005
ACM
14 years 2 months ago
Web path recommendations based on page ranking and Markov models
Markov models have been widely used for modelling users' navigational behaviour in the Web graph, using the transitional probabilities between web pages, as recorded in the w...
Magdalini Eirinaki, Michalis Vazirgiannis, Dimitri...
BPM
2009
Springer
138views Business» more  BPM 2009»
14 years 3 months ago
Graph Matching Algorithms for Business Process Model Similarity Search
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
Remco M. Dijkman, Marlon Dumas, Luciano Garc&iacut...
CIKM
2008
Springer
13 years 11 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell
ERCIMDL
2010
Springer
158views Education» more  ERCIMDL 2010»
13 years 10 months ago
Ranking Entities Using Web Search Query Logs
Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
Bodo Billerbeck, Gianluca Demartini, Claudiu S. Fi...