Sciweavers

231 search results - page 38 / 47
» Optimal Power Schedule for Distributed MIMO Links
Sort
View
FSTTCS
2004
Springer
14 years 23 days ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
ICASSP
2007
IEEE
14 years 1 months ago
Discriminative Gaussian Mixtures for Interactive Image Segmentation
Recently graph-cut optimization has been extensively explored for interactive image segmentation. In this paper we propose Discriminative Gaussian Mixtures (DGMs) to boost the per...
Jue Wang
FOCS
1997
IEEE
13 years 11 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...
MOBIHOC
2005
ACM
14 years 7 months ago
On the node-scheduling approach to topology control in ad hoc networks
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
Budhaditya Deb, Badri Nath
IPPS
2009
IEEE
14 years 2 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker