Sciweavers

141 search results - page 20 / 29
» Small-World Networks: From Theoretical Bounds to Practical S...
Sort
View
SIGCOMM
2012
ACM
11 years 9 months ago
Spinal codes
A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary wit...
Jonathan Perry, Peter Iannucci, Kermin Fleming, Ha...
CORR
2011
Springer
178views Education» more  CORR 2011»
13 years 1 months ago
Anytime Reliable Codes for Stabilizing Plants over Erasure Channels
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
Ravi Teja Sukhavasi, Babak Hassibi
GI
2004
Springer
14 years 3 days ago
Distributed Job Scheduling in a Peer-to-Peer Video Recording System
: Since the advent of Gnutella, Peer-to-Peer (P2P) protocols have matured towards a fundamental design element for large-scale, self-organising distributed systems. Many research e...
Curt Cramer, Kendy Kutzner, Thomas Fuhrmann
JSAC
2008
98views more  JSAC 2008»
13 years 6 months ago
Multiuser Detection of Sparsely Spread CDMA
Code-division multiple access (CDMA) is the basis of a family of advanced air interfaces in current and future generation networks. The benefits promised by CDMA have not been full...
Dongning Guo, Chih-Chun Wang
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
14 years 8 days ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre