Sciweavers

279 search results - page 42 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 4 months ago
Detecting Communities in Social Networks Using Max-Min Modularity.
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Jiyang Chen, Osmar R. Zaïane, Randy Goebel
LCN
2006
IEEE
14 years 1 months ago
Clustered Mobility Model for Scale-Free Wireless Networks
— Recently, researchers have discovered that many of social, natural and biological networks are characterized by scale-free power-law connectivity distribution and a few densely...
Sunho Lim, Chansu Yu, Chita R. Das
IJSNET
2006
107views more  IJSNET 2006»
13 years 7 months ago
In-network aggregation trade-offs for data collection in wireless sensor networks
This paper explores in-network aggregation as a power-efficient mechanism for collecting data in wireless sensor networks. In particular, we focus on sensor network scenarios wher...
Ignacio Solis, Katia Obraczka
AINA
2008
IEEE
14 years 2 months ago
PRODUCE: A Probability-Driven Unequal Clustering Mechanism for Wireless Sensor Networks
There has been proliferation of research on seeking for distributing the energy consumption among nodes in each cluster and between cluster heads to extend the network lifetime. H...
Jung-Hwan Kim, Sajjad Hussain Chauhdary, WenCheng ...
ICML
2007
IEEE
14 years 8 months ago
Conditional random fields for multi-agent reinforcement learning
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
Xinhua Zhang, Douglas Aberdeen, S. V. N. Vishwanat...