Sciweavers

6833 search results - page 1280 / 1367
» Some two-character sets
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 3 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
EMSOFT
2007
Springer
15 years 3 months ago
A unified practical approach to stochastic DVS scheduling
This paper deals with energy-aware real-time system scheduling using dynamic voltage scaling (DVS) for energy-constrained embedded systems that execute variable and unpredictable ...
Ruibin Xu, Rami G. Melhem, Daniel Mossé
ICDCS
2010
IEEE
15 years 3 months ago
Adaptive Jamming-Resistant Broadcast Systems with Partial Channel Sharing
—Wireless communication is particularly vulnerable to signal jamming attacks. Spread spectrum mitigates such problem by spreading normal narrowband signals over a much wider band...
Qi Dong, Donggang Liu
PERCOM
2010
ACM
15 years 3 months ago
Indoor localization in multi-floor environments with reduced effort
Abstract—In pervasive computing, localizing a user in wireless indoor environments is an important yet challenging task. Among the state-of-art localization methods, fingerprint...
Hua-Yan Wang, Vincent Wenchen Zheng, Junhui Zhao, ...
PODC
2010
ACM
15 years 3 months ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
« Prev « First page 1280 / 1367 Last » Next »