Sciweavers

530 search results - page 34 / 106
» Universal randomized switching
Sort
View
115
Voted
INFOCOM
2006
IEEE
15 years 10 months ago
Loss-Cognizant Pricing in Feed-Forward Networks with Greedy Users
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
Ashraf Al Daoud, Murat Alanyali
CORR
2007
Springer
90views Education» more  CORR 2007»
15 years 3 months ago
Discrete Denoising with Shifts
We introduce S-DUDE, a new algorithm for denoising Discrete Memoryless Channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Univer...
Taesup Moon, Tsachy Weissman
ISCAS
2007
IEEE
207views Hardware» more  ISCAS 2007»
15 years 10 months ago
Low-delay View Random Access for Multi-view Video Coding
—Multi-view video coding is becoming a very active research topic, as multi-view video system provides the interactive feature which makes viewers experience the free viewpoint n...
Yanwei Liu, Qingming Huang, Debin Zhao, Wen Gao
MOBIHOC
2007
ACM
16 years 3 months ago
Capacity of multi-channel wireless networks with random (c, f) assignment
The issue of transport capacity of a randomly deployed wireless network under random (c, f ) channel assignment was considered by us in [1]. We showed in [1] that when the number ...
Vartika Bhandari, Nitin H. Vaidya
VTC
2006
IEEE
15 years 9 months ago
Semi-Analytical Model of Interference in CDMA-TDD Using Random Time Slot Hopping
— In this paper, a semi-analytical approach for the performance analysis of the random time slot (TS) hopping (RTSH) algorithm applied to code division multiple access time divis...
Ellina Foutekova, Christine Evers, Harald Haas