2924 search results - page 199 / 585 » Lower Bounds in Distributed Computing |
122
Voted
FOCS
1995
IEEE
15 years 6 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
108
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—In this paper, we study the theory of collaborative upload bandwidth measurement in peer-to-peer environments. A host can use a bandwidth estimation probe to determine the bandw...
106
click to vote
RT
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we present a novel illumination model that takes into account multiple anisotropic scattering in a layer bounded by two rough surfaces. We compute the model by a dis...
139
click to vote
MANSCI
2008
15 years 3 months ago
2008
Value-at-Risk (VaR) is one of the most widely accepted risk measures in the financial and insurance industries, yet efficient optimization of VaR remains a very difficult problem....
131
click to vote
ITIIS
2008
15 years 3 months ago
2008
Traditional attack detection schemes based on packets or flows have very high computational complexity. And, network based anomaly detection schemes can reduce the complexity, but...