Sciweavers

1716 search results - page 206 / 344
» Proving Conditional Termination
Sort
View
67
Voted
JCT
2011
87views more  JCT 2011»
14 years 7 months ago
Chain enumeration of k-divisible noncrossing partitions of classical types
We give combinatorial proofs of the formulas for the number of multichains in the k-divisible noncrossing partitions of classical types with certain conditions on the rank and the ...
Jang Soo Kim
114
Voted
TIT
2011
128views more  TIT 2011»
14 years 7 months ago
Secure Network Coding on a Wiretap Network
—In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. With network coding, the full capacity of the netw...
Ning Cai, Raymond W. Yeung
TSP
2011
151views more  TSP 2011»
14 years 7 months ago
Stochastic Models for Sparse and Piecewise-Smooth Signals
Abstract—We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential...
Michael Unser, Pouya Dehghani Tafti
114
Voted
TSP
2010
14 years 7 months ago
Optimality of beamforming for MIMO multiple access channels via virtual representation
In this paper, we consider the optimality of beamforming for achieving the ergodic capacity of multiple-input multiple-output (MIMO) multiple access channel (MAC) via virtual repre...
Hong Wan, Rong-Rong Chen, Yingbin Liang
99
Voted
ICASSP
2011
IEEE
14 years 4 months ago
A general proof of convergence for adaptive distributed beamforming schemes
This work focuses on the convergence analysis of adaptive distributed beamforming schemes that can be reformulated as local random search algorithms via a random search framework....
Chang-Ching Chen, Chia-Shiang Tseng, Che Lin