Sciweavers

524 search results - page 23 / 105
» ets 2010
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 2 months ago
Partitions and Coverings of Trees by Bounded-Degree Subtrees
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
David R. Wood
NN
2010
Springer
189views Neural Networks» more  NN 2010»
13 years 2 months ago
Sparse kernel learning with LASSO and Bayesian inference algorithm
Kernelized LASSO (Least Absolute Selection and Shrinkage Operator) has been investigated in two separate recent papers (Gao et al., 2008) and (Wang et al., 2007). This paper is co...
Junbin Gao, Paul W. Kwan, Daming Shi
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 7 months ago
An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel
We provide an alternative proof for the capacity region of the degraded Gaussian multiple-input multiple-output (MIMO) broadcast channel. Our proof does not use the channel enhanc...
Ersen Ekrem, Sennur Ulukus
SIGPRO
2010
135views more  SIGPRO 2010»
13 years 6 months ago
A short note on compressed sensing with partially known signal support
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
Laurent Jacques
ASIACRYPT
2010
Springer
13 years 5 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan