Sciweavers

2239 search results - page 69 / 448
» Computing with abstract matrix structures
Sort
View
ICC
2007
IEEE
15 years 6 months ago
Linear Precoding with Minimum BER Criterion for MIMO-OFDM Systems Employing ML Detection
Abstract— This paper proposes a new MIMO-OFDM precoding method that minimizes BER of the maximum likelihood detection (MLD). Conventional MIMO precoding methods can approximately...
Boonsarn Pitakdumrongkija, Kazuhiko Fukawa, Hirosh...
ECAL
2003
Springer
15 years 5 months ago
Low-Level Visual Homing
Abstract. We present a variant of the snapshot model [1] for insect visual homing. In this model a snapshot image is taken by an agent at the goal position. The disparity between c...
Andrew Vardy, Franz Oppacher
TSMC
2008
148views more  TSMC 2008»
14 years 11 months ago
Stratification Approach for 3-D Euclidean Reconstruction of Nonrigid Objects From Uncalibrated Image Sequences
Abstract--This paper addresses the problem of 3-D reconstruction of nonrigid objects from uncalibrated image sequences. Under the assumption of affine camera and that the nonrigid ...
Guanghui Wang, Q. M. Jonathan Wu
SIAMSC
2011
219views more  SIAMSC 2011»
14 years 6 months ago
Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
H. P. Flath, Lucas C. Wilcox, Volkan Akcelik, Judi...
ECCC
2002
103views more  ECCC 2002»
14 years 11 months ago
Monotone complexity and the rank of matrices
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
Pavel Pudlák