Sciweavers

21007 search results - page 4123 / 4202
» Mobile Parallel Computing
Sort
View
ICDCSW
2005
IEEE
15 years 3 months ago
Control Theory Optimization of MECN in Satellite Networks
Congestion in the Internet results in wasted bandwidth and also stands in the way of guaranteeing QoS. The effect of congestion is multiplied many fold in Satellite networks, wher...
Arjan Durresi, Mukundan Sridharan, Sriram Chellapp...
ICDCSW
2005
IEEE
15 years 3 months ago
Zmail: Zero-Sum Free Market Control of Spam
The problem of spam is a classic “tragedy of the commons” [10]. We propose the Zmail protocol as a way to preserve email as a “free” common resource for most users, while ...
Benjamin Kuipers, Alex X. Liu, Aashin Gautam, Moha...
ANCS
2005
ACM
15 years 3 months ago
SSA: a power and memory efficient scheme to multi-match packet classification
New network applications like intrusion detection systems and packet-level accounting require multi-match packet classification, where all matching filters need to be reported. Te...
Fang Yu, T. V. Lakshman, Martin Austin Motoyama, R...
SIGMETRICS
2005
ACM
127views Hardware» more  SIGMETRICS 2005»
15 years 3 months ago
A data streaming algorithm for estimating subpopulation flow size distribution
Statistical information about the flow sizes in the traffic passing through a network link helps a network operator to characterize network resource usage, infer traffic demands,...
Abhishek Kumar, Minho Sung, Jun Xu, Ellen W. Zegur...
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
15 years 3 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
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 ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
« Prev « First page 4123 / 4202 Last » Next »