Sciweavers

377 search results - page 71 / 76
» Distributed computation under bit constraints
Sort
View
SOSP
2003
ACM
14 years 4 months ago
Samsara: honor among thieves in peer-to-peer storage
Peer-to-peer storage systems assume that their users consume resources in proportion to their contribution. Unfortunately, users are unlikely to do this without some enforcement m...
Landon P. Cox, Brian D. Noble
SIGCOMM
2009
ACM
14 years 2 months ago
SMS-based contextual web search
SMS-based web search is different from traditional web search in that the final response to a search query is limited to a very small number of bytes (typically 1-2 SMS messages...
Jay Chen, Brendan Linn, Lakshminarayanan Subramani...
CCR
2000
96views more  CCR 2000»
13 years 7 months ago
Decentralized optimal traffic engineering in the internet
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
Constantino M. Lagoa, Hao Che
INFOCOM
2011
IEEE
12 years 11 months ago
An analytical approach to real-time misbehavior detection in IEEE 802.11 based wireless networks
—The distributed nature of the CSMA/CA based wireless protocols, e.g., the IEEE 802.11 distributed coordinated function (DCF), allows malicious nodes to deliberately manipulate t...
Jin Tang, Yu Cheng, Weihua Zhuang
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 8 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi