2863 search results - page 162 / 573 » Constructing minimum-interference networks |
132
Voted
JAT
2010
15 years 1 months ago
2010
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
157
click to vote
MOBIHOC
2002
ACM
16 years 3 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
134
Voted
ICDCS
2010
IEEE
15 years 7 months ago
2010
IEEE
—This research focuses on distributed and localized algorithms for precise boundary detection in 3D wireless networks. Our objectives are in two folds. First, we aim to identify ...
137
Voted
SCFBM
2008
15 years 2 months ago
2008
Background: The construction of complex spatial simulation models such as those used in network epidemiology, is a daunting task due to the large amount of data involved in their ...
144
Voted
IWDC
2005
Springer
15 years 9 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...