5889 search results - page 1157 / 1178 » Graph Layout Problems |
91
Voted
SIGIR
2005
ACM
15 years 3 months ago
2005
ACM
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks...
EPEW
2005
Springer
15 years 3 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 ...
IWDC
2005
Springer
15 years 3 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
74
Voted
SSS
2005
Springer
15 years 3 months ago
2005
Springer
This paper considers the self-stabilizing unison problem. The contribution of this paper is threefold. First, we establish that when any self-stabilizing asynchronous unison protoc...
VSTTE
2005
Springer
15 years 3 months ago
2005
Springer
The interplay back and forth between software model checking and hardware model checking has been fruitful for both. Originally intended for the analysis of concurrent software, mo...