4839 search results - page 752 / 968 » A survey of computational complexity results in systems and ... |
168
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, wh...
175
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
187
click to vote
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
185
click to vote
VISUALIZATION
1997
IEEE
15 years 11 months ago
1997
IEEE
In the area of scientific visualization, input data sets are often very large. In visualization of Computational Fluid Dynamics (CFD) in particular, input data sets today can surp...
167
click to vote
SOUPS
2009
ACM
16 years 1 months ago
2009
ACM
The Windows Vista personal firewall provides its diverse users with a basic interface that hides many operational details. However, concealing the impact of network context on th...