Sciweavers

3415 search results - page 597 / 683
» Lower Bounds for Kernelizations
Sort
View
INFOCOM
2010
IEEE
13 years 8 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
SECON
2010
IEEE
13 years 8 months ago
Secondis: An Adaptive Dissemination Protocol for Synchronizing Wireless Sensor Networks
Reliability and predictability of the timing behavior have shown to be major issues for wireless sensor network deployments. Real-time requirements presented by several application...
Federico Ferrari, Andreas Meier, Lothar Thiele
TACAS
2010
Springer
212views Algorithms» more  TACAS 2010»
13 years 8 months ago
Assume-Guarantee Verification for Probabilistic Systems
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
13 years 8 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
13 years 7 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...