4926 search results - page 357 / 986 » Two Graph Algorithms On an Associative Computing Model |
145
click to vote
EPEW
2005
Springer
15 years 10 months ago
2005
Springer
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
148
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In ...
140
click to vote
COCOON
1999
Springer
15 years 9 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
144
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
166
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...