Sciweavers

338 search results - page 9 / 68
» Approximation Spaces and Information Granulation
Sort
View
GLOBECOM
2007
IEEE
14 years 1 months ago
Symbol Error Rate Calculation for Alamouti Space Time Coded OFDM in Direct Conversion Receivers
—In this paper we present an analytical approach to evaluate the M-QAM symbol error rate (SER) of Alamouti space time coded OFDM direct conversion receivers subject to carrier fr...
Marco Krondorf, Gerhard Fettweis
VTC
2006
IEEE
174views Communications» more  VTC 2006»
14 years 1 months ago
ML Detection with Blind Linear Prediction for Differential Space-Time Block Code Systems
Abstract— This paper proposes a maximum likelihood detection (MLD) method for the differential space-time block code (DSTBC) in cooperation with blind linear prediction (BLP) of ...
Seree Wanichpakdeedecha, Kazuhiko Fukawa, Hiroshi ...
DSN
2011
IEEE
12 years 7 months ago
Approximate analysis of blocking queueing networks with temporal dependence
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
Vittoria de Nitto Persone, Giuliano Casale, Evgeni...
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 7 months ago
Approximately detecting duplicates for streaming data using stable bloom filters
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
Fan Deng, Davood Rafiei
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 8 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu