Sciweavers

2001 search results - page 84 / 401
» Local solutions for global problems in wireless networks
Sort
View
EWSN
2009
Springer
14 years 9 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
MOBICOM
2012
ACM
11 years 11 months ago
Locating in fingerprint space: wireless indoor localization with little human intervention
Indoor localization is of great importance for a range of pervasive applications, attracting many research efforts in the past decades. Most radio-based solutions require a proce...
Zheng Yang, Chenshu Wu, Yunhao Liu
PR
2008
88views more  PR 2008»
13 years 8 months ago
Modified global k
Clustering in gene expression data sets is a challenging problem. Different algorithms for clustering of genes have been proposed. However due to the large number of genes only a ...
Adil M. Bagirov
SENSYS
2009
ACM
14 years 3 months ago
Achieving range-free localization beyond connectivity
Wireless sensor networks have been proposed for many location-dependent applications. In such applications, the requirement of low system cost prohibits many range-based methods f...
Ziguo Zhong, Tian He
JPDC
2006
187views more  JPDC 2006»
13 years 9 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna