Sciweavers

251 search results - page 33 / 51
» Distributed algorithms for edge dominating sets
Sort
View
ICML
2006
IEEE
15 years 10 months ago
An analysis of graph cut size for transductive learning
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...
Steve Hanneke
FOCS
1997
IEEE
15 years 1 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
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...
Matthew Andrews, Antonio Fernández, Mor Har...
IPPS
2003
IEEE
15 years 3 months ago
A Generic Broadcast Protocol in Ad Hoc Networks Based on Self-Pruning
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...
Jie Wu, Fei Dai
AAAI
2008
15 years 1 days ago
Dormant Independence
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...
Ilya Shpitser, Judea Pearl
SIGECOM
2005
ACM
117views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
First-price path auctions
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 ...
Nicole Immorlica, David R. Karger, Evdokia Nikolov...