230 search results - page 15 / 46 » Time Varying Undirected Graphs |
ICC
2007
IEEE
15 years 5 months ago
2007
IEEE
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...
AAAI
2008
15 years 1 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
119
click to vote
ESA
2007
Springer
15 years 5 months ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
101
click to vote
MFCS
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
GD
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...