Sciweavers

914 search results - page 121 / 183
» Branch and Bound on the Network Model
Sort
View
CCS
2009
ACM
15 years 10 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
INFOCOM
2006
IEEE
15 years 3 months ago
Sleeping Coordination for Comprehensive Sensing Using Isotonic Regression and Domatic Partitions
— We address the problem of energy efficient sensing by adaptively coordinating the sleep schedules of sensor nodes while guaranteeing that values of sleeping nodes can be recov...
Farinaz Koushanfar, Nina Taft, Miodrag Potkonjak
COMCOM
2006
168views more  COMCOM 2006»
14 years 10 months ago
Relay node placement in large scale wireless sensor networks
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Jian Tang, Bin Hao, Arunabha Sen
ADHOCNOW
2008
Springer
15 years 4 months ago
Request Satisfaction Problem in Synchronous Radio Networks
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
Benoît Darties, Sylvain Durand, Jér&o...
ESTIMEDIA
2007
Springer
15 years 4 months ago
Network Calculus Applied to Verification of Memory Access Performance in SoCs
SoCs for multimedia applications typically use only one port to off-chip DRAM for cost reasons. The sharing of interconnect and the off-chip DRAM port by several IP blocks makes t...
Tomas Henriksson, Pieter van der Wolf, Axel Jantsc...