Sciweavers

6740 search results - page 1328 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
158
Voted
EPEW
2005
Springer
15 years 11 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
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 ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
15 years 11 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
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...
Michael Q. Rieck, Subhankar Dhar
129
Voted
SSS
2005
Springer
15 years 10 months ago
Synchronous vs. Asynchronous Unison
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...
Christian Boulinier, Franck Petit, Vincent Villain
147
Voted
VSTTE
2005
Springer
15 years 10 months ago
Model Checking: Back and Forth between Hardware and Software
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...
Edmund M. Clarke, Anubhav Gupta, Himanshu Jain, He...
203
Voted
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 10 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
« Prev « First page 1328 / 1348 Last » Next »