Sciweavers

11 search results - page 1 / 3
» The Communication Complexity of Enumeration, Elimination, an...
Sort
View
COCO
2000
Springer
125views Algorithms» more  COCO 2000»
13 years 10 months ago
The Communication Complexity of Enumeration, Elimination, and Selection
Andris Ambainis, Harry Buhrman, William I. Gasarch...
INFOCOM
1997
IEEE
13 years 10 months ago
Analyzing Non-Determinism in Telecommunication Services Using P-Invariant of Petri-Net Model
The non-deterministic behaviors in telecommunication services are well-known as one of the most typical Feature Interactions, and they should be detected and eliminated from the t...
Masahide Nakamura, Yoshiaki Kakuda, Tohru Kikuno
VTC
2008
IEEE
189views Communications» more  VTC 2008»
14 years 11 days ago
Selective Mapping with Symbol Re-Mapping for OFDM/TDM Using MMSE-FDE
—Orthogonal frequency division multiplexing (OFDM) signals have a problem with high peak-to-average power ratio (PAPR). A distortionless selective mapping (SLM) has been proposed...
Haris Gacanin, Fumiyuki Adachi
IPPS
1997
IEEE
13 years 9 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
ITCC
2000
IEEE
13 years 10 months ago
Projection-Based Multiuser Receiver over Frequency Selective Channels
In multiuser communication, the receiver’s performance is degraded by multiuser interference (MUI) as well as multipath distortions. This paper aims at elimination of these side...
Zhengyuan (Daniel) Xu