Sciweavers

APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 10 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
140
Voted
APPROX
2007
Springer
87views Algorithms» more  APPROX 2007»
15 years 10 months ago
Stochastic Steiner Tree with Non-uniform Inflation
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar
APNOMS
2007
Springer
15 years 10 months ago
OMA DM Based Remote Software Debugging of Mobile Devices
The mobile devices have gained much functionality and intelligence with the growth of network technologies, the abundance of network resources, and the increase of various services...
Joon-Myung Kang, Hong-Taek Ju, Mi-Jung Choi, James...
APNOMS
2007
Springer
15 years 10 months ago
End-to-End Flow Monitoring with IPFIX
End-to-End (E2E) flow monitoring is useful for observing performance of networks such as throughput, loss rate, and jitter. Typically, E2E flow monitoring is carried out at end hos...
Byungjoon Lee, Hyeongu Son, Seunghyun Yoon, Youngs...
APNOMS
2007
Springer
15 years 10 months ago
Security Management in Wireless Sensor Networks with a Public Key Based Scheme
This paper proposes an efficient approach for managing the security in WSN. Our approach uses the notion of public key cryptography in which two different keys are used for encrypt...
Al-Sakib Khan Pathan, Jae Hyun Ryu, Md. Mokammel H...