4913 search results - page 148 / 983 » Results and Perspectives of the G |
155
click to vote
FOCS
2008
IEEE
16 years 29 days ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
180
click to vote
COCOON
2005
Springer
16 years 1 days ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
182
click to vote
OOPSLA
2004
Springer
15 years 12 months ago
2004
Springer
This paper presents the design of G, a new language specifically created for generic programming. We review and identify important language features of C++ and Haskell in light o...
160
click to vote
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
174
click to vote
SPAA
2000
ACM
15 years 11 months ago
2000
ACM
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...