Sciweavers

3528 search results - page 422 / 706
» A New Approach to Planning in Networks
Sort
View
193
Voted
ICML
2007
IEEE
16 years 7 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
ICETET
2009
IEEE
16 years 1 months ago
Best Fit Void Filling Algorithm in Optical Burst Switching Networks
: Optical Burst Switching is a promising technology in Optical Network. Scheduling of data burst in data channels in an optimal way is one of a key problem in Optical Burst Switche...
M. Nandi, Ashok K. Turuk, D. K. Puthal, S. Dutta
RTSS
2007
IEEE
16 years 1 months ago
Real-Time Query Scheduling for Wireless Sensor Networks
Recent years have seen the emergence of wireless sensor network systems that must support high data rate and realtime queries of physical environments. This paper proposes Real-Ti...
Octav Chipara, Chenyang Lu, Gruia-Catalin Roman
303
Voted
PDP
2006
IEEE
16 years 22 days ago
A Hierarchical Consensus Protocol for Mobile Ad Hoc Networks
Mobile ad hoc networks (MANETs) raise new challenges in designing protocols for solving the consensus problem. Among the others, how to design message efficient protocols so as to...
Weigang Wu, Jiannong Cao, Jin Yang, Michel Raynal
ICDE
2005
IEEE
130views Database» more  ICDE 2005»
16 years 10 days ago
Data Acquisition in Sensor Networks with Large Memories
Sensor Networks will soon become ubiquitous, making them essential tools for monitoring the activity and evolution of our surrounding environment. However such environments are ex...
Demetrios Zeinalipour-Yazti, Vana Kalogeraki, Dimi...