Sciweavers

3415 search results - page 145 / 683
» Lower Bounds for Kernelizations
Sort
View
TOC
2008
71views more  TOC 2008»
15 years 4 months ago
The One-Way Communication Complexity of Hamming Distance
Abstract: Consider the following version of the Hamming distance problem for
T. S. Jayram, Ravi Kumar, D. Sivakumar
JCO
2010
82views more  JCO 2010»
15 years 2 months ago
Embedded paths and cycles in faulty hypercubes
An important task in the theory of hypercubes is to establish the maximum integer fn such that for every set F of f vertices in the hypercube Qn, with 0 ≤ f ≤ fn, there exists ...
Nelson Castañeda, Ivan S. Gotchev
TIT
2008
109views more  TIT 2008»
15 years 2 months ago
Joint Source-Channel Codes for MIMO Block-Fading Channels
We consider transmission of a continuous amplitude source over an L-block Rayleigh fading Mt
Deniz Gündüz, Elza Erkip
ICASSP
2011
IEEE
14 years 8 months ago
Sum-rate maximization of two-way amplify-and-forward relay networks with imperfect channel state information
Considering a two-way amplify-and-forward (AF) relay network and aiming to simultaneously maximize the two users’ mutual information lower bounds in the presence of channel esti...
Yupeng Jia, Azadeh Vosoughi
NIPS
2004
15 years 5 months ago
Efficient Kernel Discriminant Analysis via QR Decomposition
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Re...
Tao Xiong, Jieping Ye, Qi Li, Ravi Janardan, Vladi...