Sciweavers

2084 search results - page 265 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
15 years 3 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
JSC
2006
95views more  JSC 2006»
14 years 10 months ago
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
Nicholas Eriksson, Stephen E. Fienberg, Alessandro...
ISCC
2003
IEEE
15 years 3 months ago
Wireless Token Ring Protocol-Performance Comparison with IEEE 802.11
The paper presents the performance advantage of Wireless Token Ring Protocol (WTRP) versus IEEE 802.11 in DCF mode. WTRP is a medium access control (MAC) protocol and is designed ...
Mustafa Ergen, Duke Lee, Raja Sengupta, Pravin Var...
PE
2008
Springer
108views Optimization» more  PE 2008»
14 years 10 months ago
Rate-optimal schemes for Peer-to-Peer live streaming
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
Laurent Massoulié, Andrew Twigg
GLOBECOM
2007
IEEE
15 years 4 months ago
Optimizing P2P Streaming Throughput Under Peer Churning
Abstract— High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s) of streaming. Although this problem has been t...
Yi Cui, Liang Dai, Yuan Xue