Sciweavers

672 search results - page 108 / 135
» Almost Optimal Dispersers
Sort
View
EJC
2007
13 years 8 months ago
Online balanced graph avoidance games
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
JSAC
2006
81views more  JSAC 2006»
13 years 8 months ago
Fast linearized energy allocation for multimedia loading on multicarrier systems
Abstract--Efficient near-optimal energy allocation for multimedia data transmission using multicarrier modulation is investigated. The optimal method typically relies on an iterati...
Michael A. Enright, C. C. Jay Kuo
PERCOM
2008
ACM
13 years 8 months ago
Randomized Bit Encoding for Stronger Backward Channel Protection in RFID Systems
In this paper, we introduce a randomized bit encoding scheme that can strengthen the privacy protection on RFID tags. This scheme is used together with the backward channel protec...
Tong-Lee Lim, Tieyan Li, Sze-Ling Yeo
TCAD
2008
119views more  TCAD 2008»
13 years 8 months ago
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
Chris C. N. Chu, Yiu-Chung Wong
TWC
2008
117views more  TWC 2008»
13 years 8 months ago
Achievable Rates and Fairness in Rateless Coded Relaying Schemes
Abstract--The average throughput of three decode-andforward (DF) half-duplex (DFHD) and two DF full-duplex (DFFD) rateless coded relaying schemes are studied under a peak power con...
Reza Nikjah, Norman C. Beaulieu