29908 search results - page 139 / 5982 » On the complexity of communication complexity |
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Clipping and filtering is an attractive method for the reduction of the PAPR of OFDM signals before transmission. However, the resulting in-band distortion noise impacts the e...
ISCAS
2006
IEEE
15 years 4 months ago
2006
IEEE
Abstract— Providing Quality-of-Service (QoS) in networks-onchip (NoCs) will be an important consideration for the complex multiprocessor chips of the future. In this paper, we di...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, we propose an O(1) complexity round robin scheduler, called Fair Round Robin (FRR), that provides good fairness and delay properties. Unlike existing O(1) complexit...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Over the last decade significant progress in optoelectronic devices and their integration techniques have made Free-Space Optical Interconnects (FSOI) one of the few physical appro...