Sciweavers

1480 search results - page 45 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
STACS
2004
Springer
14 years 28 days ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
INFOCOM
2005
IEEE
14 years 1 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
CLUSTER
2002
IEEE
13 years 7 months ago
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
Mainak Chatterjee, Sajal K. Das, Damla Turgut
JMLR
2011
145views more  JMLR 2011»
13 years 2 months ago
Cumulative Distribution Networks and the Derivative-sum-product Algorithm: Models and Inference for Cumulative Distribution Func
We present a class of graphical models for directly representing the joint cumulative distribution function (CDF) of many random variables, called cumulative distribution networks...
Jim C. Huang, Brendan J. Frey
DAM
2008
145views more  DAM 2008»
13 years 7 months ago
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
Shahadat Hossain, Trond Steihaug