251 search results - page 33 / 51 » Distributed algorithms for edge dominating sets |
124
Voted
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
138
Voted
FOCS
1997
IEEE
15 years 8 months ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
130
Voted
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
In ad hoc wireless networks, a successful broadcasting requires that the nodes forwarding the broadcast packet form a connected dominating set to ensure the coverage. An efficien...
139
Voted
AAAI
2008
15 years 6 months ago
2008
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
143
Voted
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...