Sciweavers

264 search results - page 7 / 53
» First order LUB approximations: characterization and algorit...
Sort
View
ECRTS
2009
IEEE
14 years 9 months ago
Approximate Bandwidth Allocation for Compositional Real-Time Systems
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
Nathan Fisher, Farhana Dewan
CONEXT
2006
ACM
15 years 5 months ago
Detail characterization of paths in pocket switched networks
Pocket Switched Networking (PSN) is a new communication paradigm between mobile devices. It takes advantage of every local communication opportunity, and the physical mobility of ...
Abderrahmen Mtibaa, Augustin Chaintreau, Christoph...
86
Voted
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 3 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
84
Voted
EWSN
2004
Springer
15 years 5 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
102
Voted
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 5 days 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