Results 1 - 10 of 1,945

The Aurora Experimental Framework for the Performance Evaluation of Speech Recognition Systems under Noisy Conditions

by David Pearce, Hans-günter Hirsch, Ericsson Eurolab Deutschland Gmbh - in ISCA ITRW ASR2000 , 2000
"... This paper describes a database designed to evaluate the performance of speech recognition algorithms in noisy conditions. The database may either be used to measure frontend feature extraction algorithms, using a defined HMM recognition back-end, or complete recognition systems. The source speech f ..."
Abstract - Cited by 534 (6 self) - Add to MetaCart
This paper describes a database designed to evaluate the performance of speech recognition algorithms in noisy conditions. The database may either be used to measure frontend feature extraction algorithms, using a defined HMM recognition back-end, or complete recognition systems. The source speech

Loopy belief propagation for approximate inference: An empirical study. In:

by Kevin P Murphy , Yair Weiss , Michael I Jordan - Proceedings of Uncertainty in AI, , 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract - Cited by 676 (15 self) - Add to MetaCart
Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon

Stable recovery of sparse overcomplete representations in the presence of noise

by David L. Donoho, Michael Elad, Vladimir N. Temlyakov - IEEE TRANS. INFORM. THEORY , 2006
"... Overcomplete representations are attracting interest in signal processing theory, particularly due to their potential to generate sparse representations of signals. However, in general, the problem of finding sparse representations must be unstable in the presence of noise. This paper establishes t ..."
Abstract - Cited by 460 (22 self) - Add to MetaCart
the possibility of stable recovery under a combination of sufficient sparsity and favorable structure of the overcomplete system. Considering an ideal underlying signal that has a sufficiently sparse representation, it is assumed that only a noisy version of it can be observed. Assuming further

On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming

by Taesang Yoo, Andrea Goldsmith - IEEE J. SELECT. AREAS COMMUN , 2006
"... Although the capacity of multiple-input/multiple-output (MIMO) broadcast channels (BCs) can be achieved by dirty paper coding (DPC), it is difficult to implement in practical systems. This paper investigates if, for a large number of users, simpler schemes can achieve the same performance. Specifica ..."
Abstract - Cited by 308 (4 self) - Add to MetaCart
. Specifically, we show that a zero-forcing beamforming (ZFBF) strategy, while generally suboptimal, can achieve the same asymptotic sum capacity as that of DPC, as the number of users goes to infinity. In proving this asymptotic result, we provide an algorithm for determining which users should be active under

Capacity of Wireless Erasure Networks

by Amir F. Dana, Radhika Gowaikar, Ravi Palanki, Babak Hassibi, Michelle Effros - IEEE TRANSACTIONS ON INFORMATION THEORY , 2006
"... In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring eac ..."
Abstract - Cited by 149 (12 self) - Add to MetaCart
In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring

Broadcast gossip algorithms for consensus

by Tuncer Can Aysal, Mehmet Ercan Yildiz, Anand D. Sarwate, Anna Scaglione - IEEE TRANS. SIGNAL PROCESS , 2009
"... Motivated by applications to wireless sensor, peer-to-peer, and ad hoc networks, we study distributed broadcasting algorithms for exchanging information and computing in an arbitrarily connected network of nodes. Specifically, we study a broadcasting-based gossiping algorithm to compute the (possib ..."
Abstract - Cited by 93 (7 self) - Add to MetaCart
Motivated by applications to wireless sensor, peer-to-peer, and ad hoc networks, we study distributed broadcasting algorithms for exchanging information and computing in an arbitrarily connected network of nodes. Specifically, we study a broadcasting-based gossiping algorithm to compute

On the Influence of the Kernel on the Consistency of Support Vector Machines

by Ingo Steinwart - Journal of Machine Learning Research , 2001
"... In this article we study the generalization abilities of several classifiers of support vector machine (SVM) type using a certain class of kernels that we call universal. It is shown that the soft margin algorithms with universal kernels are consistent for a large class of classification problems ..."
Abstract - Cited by 212 (21 self) - Add to MetaCart
In this article we study the generalization abilities of several classifiers of support vector machine (SVM) type using a certain class of kernels that we call universal. It is shown that the soft margin algorithms with universal kernels are consistent for a large class of classification

CODING AND SCHEDULING IN NETWORKS FOR ERASURES AND BROADCAST

by Subha Ramakrishna Gummadi , 2011
"... ... is concerned with the design and analysis of algorithms that address two related issues in communication networks, namely erasures and broadcast. Erasures are an appropriate model for communication channels from a network layer perspective. A class of efficient and flexible codes known as founta ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
... is concerned with the design and analysis of algorithms that address two related issues in communication networks, namely erasures and broadcast. Erasures are an appropriate model for communication channels from a network layer perspective. A class of efficient and flexible codes known

Progressive Transmission of Images over Memoryless Noisy Channels

by Vinay Chande, Nariman Farvardin , 2000
"... An embedded source code allows the decoder to reconstruct the source progressively from the prefixes of a single bit stream. It is desirable to design joint source-channel coding schemes which retain the capability of progressive reconstruction in the presence of channel noise or packet loss. Here, ..."
Abstract - Cited by 72 (0 self) - Add to MetaCart
transmission rate, we provide solutions and an algorithm for the design of optimal unequal error/erasure protection. Three performance measures are considered: the average distortion, the average Peak Signal-to-Noise Ratio and the average useful source coding rate. Under the assumption of rate compatibility

XOR-based Coding for the 3-user Broadcast Erasure Channel with Feedback

by Sophia Athanasiadou, Marios Gatzianas, Leonidas Georgiadis, Ros Tassiulas
"... Abstract—We study the case of the three-user broadcast erasure channel, with multiple unicast traffic, where feedback from the users is fed back to the transmitter in the form of ACK/NACK messages. The capacity region of this system has been recently derived and two capacity achieving algorithms, em ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract—We study the case of the three-user broadcast erasure channel, with multiple unicast traffic, where feedback from the users is fed back to the transmitter in the form of ACK/NACK messages. The capacity region of this system has been recently derived and two capacity achieving algorithms
Results 1 - 10 of 1,945