Sciweavers

288 search results - page 32 / 58
» Notes on computing minimal approximant bases
Sort
View
WCNC
2010
IEEE
13 years 8 months ago
Robust Relay Precoder Design for MIMO-Relay Networks
Abstract—In this paper, we consider a robust design of MIMOrelay precoder and receive filter for the destination nodes in a non-regenerative multiple-input multiple-output (MIMO...
P. Ubaidulla, Ananthanarayanan Chockalingam
MANSCI
2008
122views more  MANSCI 2008»
13 years 9 months ago
Incorporating Asymmetric Distributional Information in Robust Value-at-Risk Optimization
Value-at-Risk (VaR) is one of the most widely accepted risk measures in the financial and insurance industries, yet efficient optimization of VaR remains a very difficult problem....
Karthik Natarajan, Dessislava Pachamanova, Melvyn ...
TWC
2008
129views more  TWC 2008»
13 years 9 months ago
Spatial Multiplexing Architectures with Jointly Designed Rate-Tailoring and Ordered BLAST Decoding - Part II: A Practical Method
The study of the class of new spatial multiplexing architectures (SMAs) is continued. As introduced in Part I of this paper, the SMAs consist of joint design of rate and power all...
Yi Jiang, Mahesh K. Varanasi
CVPR
2011
IEEE
13 years 6 months ago
Piecing Together the Segmentation Jigsaw using Context
We present an approach to jointly solve the segmentation and recognition problem using a multiple segmentation framework. We formulate the problem as segment selection from a pool...
Xi Chen, Arpit Jain, Abhinav Gupta, Larry Davis
FOCS
2008
IEEE
14 years 4 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...