Sciweavers

2266 search results - page 218 / 454
» Generalizing parametric timing analysis
Sort
View
117
Voted
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 1 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
168
Voted
MOBIHOC
2005
ACM
16 years 22 days ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula
104
Voted
WSC
2004
15 years 2 months ago
Building Credible Input Models
Most discrete-event simulation models have stochastic elements that mimic the probabilistic nature of the system under consideration. A close match between the input model and the...
Lawrence Leemis
144
Voted
TMC
2008
129views more  TMC 2008»
15 years 1 months ago
Mobility Modeling and Performance Evaluation of Heterogeneous Wireless Networks
The future-generation wireless systems will combine heterogeneous wireless access technologies to provide mobile users with seamless access to a diverse set of applications and ser...
Ahmed H. Zahran, Ben Liang, Aladdin Saleh
114
Voted
MOBIHOC
2006
ACM
16 years 22 days ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...