Sciweavers

3009 search results - page 491 / 602
» The Expressive Rate of Constraints
Sort
View
INFOCOM
2006
IEEE
15 years 4 months ago
On the Capacity of Optical Networks: A Framework for Comparing Different Transport Architectures
— In this work, we compare three optical transport network architectures: optical packet switching (OPS), optical flow switching (OFS), and optical burst switching (OBS). Our co...
Guy Weichenberg, Vincent W. S. Chan, Muriel M&eacu...
RTAS
2006
IEEE
15 years 4 months ago
On Non-Utilization Bounds for Arbitrary Fixed Priority Policies
Prior research on schedulability bounds focused primarily on bounding utilization as a means to meet deadline constraints. Non-trivial bounds were found for a handful of schedulin...
Xue Liu, Tarek F. Abdelzaher
VTC
2006
IEEE
15 years 4 months ago
Using Unclaimed Sub-Carriers in Opportunistic OFDMA Systems
Abstract— In this paper, we consider the unclaimed subcarriers that no user feeds back in an opportunistic OFDMA system with a per sub-carrier power constraint. Unclaimed subcarr...
Patrick Svedman, Leonard J. Cimini Jr., Björn...
WMTE
2006
IEEE
15 years 4 months ago
Handheld-Mediated Communication to Support the Effective Sharing of Meaning in Joint Activity
This paper reports the results of a laboratory study of a proposed solution to the problem of coordinating entry into collaborative activity while protecting the privacy and contr...
Kibum Kim, Deborah G. Tatar, Steve R. Harrison
AAECC
2006
Springer
105views Algorithms» more  AAECC 2006»
15 years 4 months ago
LDPC Codes for Fading Channels: Two Strategies
Abstract. This paper compares two approaches to reliable communication over fading channels using low-density parity check (LDPC) codes. The particular model considered is the bloc...
Xiaowei Jin, Teng Li, Thomas E. Fuja, Oliver M. Co...