288 search results - page 32 / 58 » Notes on computing minimal approximant bases |
110
click to vote
WCNC
2010
IEEE
15 years 9 days ago
2010
IEEE
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...
129
click to vote
MANSCI
2008
15 years 1 months ago
2008
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....
TWC
2008
15 years 1 months ago
2008
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...
113
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
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...
146
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
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:...