Sciweavers

1510 search results - page 117 / 302
» Upper Probabilities and Additivity
Sort
View
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
15 years 3 months ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei
INFOCOM
2003
IEEE
15 years 3 months ago
Limit Behavior of ECN/RED Gateways Under a Large Number of TCP Flows
— We consider a stochastic model of an ECN/RED gateway with competing TCP sources sharing the capacity. As the number of competing flows becomes large, the queue behavior at the...
Peerapol Tinnakornsrisuphap, Armand M. Makowski
IPPS
2000
IEEE
15 years 2 months ago
Congestion-Free Routing of Streaming Multimedia Content in BMIN-Based Parallel Systems
Abstract. Multimedia servers are increasingly employing parallel systems for the retrieval, scheduling and delivery of streaming multimedia content. However, given non-zero blockin...
Harish Sethu
ARTS
1999
Springer
15 years 2 months ago
Process Algebra with Probabilistic Choice
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this probl...
Suzana Andova
IPPS
1998
IEEE
15 years 2 months ago
Sharing Random Bits with No Process Coordination
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
Marius Zimand