Sciweavers

549 search results - page 87 / 110
» Integer-Forcing Linear Receivers
Sort
View
ICML
2006
IEEE
14 years 9 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth
DCC
2002
IEEE
14 years 8 months ago
Rate-Based versus Distortion-Based Optimal Joint Source-Channel Coding
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
Raouf Hamzaoui, Vladimir Stankovic
NOSSDAV
2009
Springer
14 years 3 months ago
Random network coding on the iPhone: fact or fiction?
In multi-hop wireless networks, random network coding represents the general design principle of transmitting random linear combinations of blocks in the same “batch” to downs...
Hassan Shojania, Baochun Li
FOCS
2008
IEEE
14 years 3 months ago
Network Extractor Protocols
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...
Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerm...
GLOBECOM
2007
IEEE
14 years 3 months ago
A Distributed Approach to Interference Cancellation
Abstract—In this paper1, we propose and analyze a novel idea of performing interference cancellation (IC) in a distributed/cooperative manner, with a motivation to provide multiu...
K. Raghu, Saif K. Mohammed, Ananthanarayanan Chock...