336 search results - page 15 / 68 » Approximating Transitivity in Directed Networks |
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
SPAA
2010
ACM
14 years 6 days ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
NIPS
2000
13 years 8 months ago
2000
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
INFOCOM
2012
IEEE
11 years 9 months ago
2012
IEEE
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract—In this paper we examine how transit and customer prices are set in a network consisting of multiple ISPs. Some ISPs may be geographically co-located so that they compet...