Sciweavers

154 search results - page 15 / 31
» Optimization problems in multiple subtree graphs
Sort
View
IPPS
2005
IEEE
15 years 3 months ago
On the Optimal Placement of Secure Data Objects over Internet
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, Farok...
ICCD
2001
IEEE
121views Hardware» more  ICCD 2001»
15 years 6 months ago
Determining Schedules for Reducing Power Consumption Using Multiple Supply Voltages
Dynamic power is the main source of power consumption in CMOS circuits. It depends on the square of the supply voltage. It may significantly be reduced by scaling down the supply ...
Noureddine Chabini, El Mostapha Aboulhamid, Yvon S...
IPPS
2005
IEEE
15 years 3 months ago
Optimal Channel Assignments for Lattices with Conditions at Distance Two
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
Jerrold R. Griggs, Xiaohua Teresa Jin
GLOBECOM
2007
IEEE
15 years 3 months ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu
99
Voted
IPSN
2005
Springer
15 years 2 months ago
Tracking on a graph
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
Songhwai Oh, Shankar Sastry