365 search results - page 44 / 73 » Fast construction of overlay networks |
111
click to vote
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
SYRCODIS
2008
15 years 1 months ago
2008
In this research we introduce the problem of the binary matrix partitioning in a biological context. Our idea is to use SNP matrix to construct a set of phylogenetic networks to r...
STOC
2003
ACM
16 years 3 days ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
134
click to vote
KIVS
2011
Springer
14 years 2 months ago
2011
Springer
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
112
click to vote
IM
2008
14 years 11 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...