Sciweavers

1265 search results - page 196 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
MPLOT: A Transport Protocol Exploiting Multipath Diversity Using Erasure Codes
—In this paper, we propose a novel transport protocol that effectively utilizes available bandwidth and diversity gains provided by heterogeneous, highly lossy paths. Our Multi-P...
Vicky Sharma, Shivkumar Kalyanaraman, Koushik Kar,...
INFOCOM
2000
IEEE
14 years 3 days ago
Stochastic Modeling of TCP over Lossy Links
—An analytical framework for modeling the performance of a single TCP session in the presence of random packet loss is presented. A Markovian approach is developed that allows us...
Alhussein A. Abouzeid, Sumit Roy, Murat Azizoglu
UAI
1996
13 years 9 months ago
Critical Remarks on Single Link Search in Learning Belief Networks
In learning belief networks, the single link lookahead search is widely adopted to reduce the search space. We show that there exists a class of probabilistic domain models which ...
Yang Xiang, S. K. Michael Wong, Nick Cercone
TOMACS
2011
139views more  TOMACS 2011»
13 years 2 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 16 days ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld