Sciweavers

141 search results - page 7 / 29
» Small-World Networks: From Theoretical Bounds to Practical S...
Sort
View
CIKM
2009
Springer
14 years 1 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
14 years 4 months ago
System-wide energy minimization for real-time tasks: lower bound and approximation
We present a dynamic voltage scaling (DVS) technique that minimizes system-wide energy consumption for both periodic and sporadic tasks. It is known that a system consists of proc...
Xiliang Zhong, Cheng-Zhong Xu
INFOCOM
2011
IEEE
12 years 10 months ago
SelectCast: Scalable data aggregation scheme in wireless sensor networks
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
Cheng Wang, ShaoJie Tang, Xiang-Yang Li, Changjun ...
ACSAC
2002
IEEE
14 years 9 days ago
Enforcing Resource Bound Safety for Mobile SNMP Agents
The integration of mobile agents with SNMP creates significant advantages for the management of complex networks. Nevertheless, the security concerns of mobile agent technology l...
Weijiang Yu, Aloysius K. Mok
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 1 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza