Sciweavers

653 search results - page 122 / 131
» The size of minimum 3-trees
Sort
View
FOCS
2007
IEEE
15 years 3 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
ICC
2007
IEEE
110views Communications» more  ICC 2007»
15 years 3 months ago
Resource Optimization to Provision a Virtual Private Network Using the Hose Model
— Virtual Private Networks (VPN) provide a secure and reliable communication between customer sites over a shared network. With increase in number and size of VPNs, providers nee...
Monia Ghobadi, Sudhakar Ganti, Gholamali C. Shoja
ICC
2007
IEEE
106views Communications» more  ICC 2007»
15 years 3 months ago
A Hierarchical Weighted Round Robin EPON DBA Scheme and Its Comparison with Cyclic Water-Filling Algorithm
—A H-WRR (Hierarchical Weighted Round-Robin) EPON (Ethernet Passive Optical Network) DBA (Dynamic Bandwidth Allocation) algorithm is devised and investigated. WRR table entries h...
Chan Kim, Tae-Whan Yoo, Bong-Tae Kim
ICC
2007
IEEE
124views Communications» more  ICC 2007»
15 years 3 months ago
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks
—In a wireless sensor network, the network lifetime is an important issue when the size of the network is large. In order to make the network scalable, it is divided into a numbe...
Marudachalam Dhanaraj, C. Siva Ram Murthy
GLOBECOM
2007
IEEE
15 years 3 months ago
Path Diversity in Packet Switched Networks: Performance Analysis and Rate Allocation
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...
Shervan Fashandi, Shahab Oveis Gharan, Amir K. Kha...