Sciweavers

710 search results - page 62 / 142
» On Minimum Power Connectivity Problems
Sort
View
IMCSIT
2010
13 years 5 months ago
Efficient Coloring of Wireless Ad Hoc Networks With Diminished Transmitter Power
In our work we present a new approach to the problem of channel assignment in Wireless Ad Hoc Network. We introduce a new algorithm which works in distributed model of computations...
Krzysztof Krzywdzinski
DSN
2005
IEEE
14 years 1 months ago
On Partial Protection in Groomed Optical WDM Mesh Networks
In this paper, we consider the problem of survivable network design in traffic groomed optical WDM mesh networks with sub-wavelength capacity connections. In typical survivable n...
Jing Fang, Mahesh Sivakumar, Arun K. Somani, Krish...
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
13 years 9 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
FSTTCS
2009
Springer
14 years 2 months ago
The Power of Depth 2 Circuits over Algebras
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
14 years 13 days ago
A poset framework to model decentralized control problems
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...
Parikshit Shah, Pablo A. Parrilo