806 search results - page 73 / 162 » Lower Bounds on Correction Networks |
172
Voted
DM
2007
15 years 6 months ago
2007
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
149
click to vote
INFOCOM
2007
IEEE
16 years 11 days ago
2007
IEEE
— We consider a collocated wireless network where all links contend for a given channel and each link can hear others’ transmissions. Due to channel fading, the link condition ...
155
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
147
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper presents a sum of squares (SOS) approach to the stability analysis of networked control systems (NCSs) incorporating time-varying delays and time-varying transmission in...
150
click to vote
TCOM
2011
15 years 1 months ago
2011
—To lower costs, WDM PONs may share the usage of wavelengths, transmitters, and receivers among ONUs, instead of dedicating the transmission between OLT and each ONU with one ind...