Sciweavers

393 search results - page 59 / 79
» Approximation Algorithm for Directed Telephone Multicast Pro...
Sort
View
INFOCOM
2010
IEEE
13 years 5 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
12 years 7 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 7 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
MOBILITY
2009
ACM
14 years 1 months ago
A membership management protocol for mobile P2P networks
MANETs are self-organizing networks composed of mobile wireless nodes with often scarce resources. Distributed applications based on the P2P paradigm are by nature good candidates...
Mohamed Karim Sbai, Emna Salhi, Chadi Barakat
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang