485 search results - page 87 / 97 » Iterative Bounding LAO |
JMLR
2010
14 years 4 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
104
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We study a new gigapixel image sensor that is reminiscent of traditional photographic film. Each pixel in the sensor has a binary response, giving only a one-bit quantized measur...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper describes a new approximate maximum-likelihood (ML) MIMO detection approach by studying a Lagrangian dual relaxation (LDR) of ML. Unlike many existing relaxed ML method...
104
click to vote
ICCV
2011
IEEE
13 years 10 months ago
2011
IEEE
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
ECCV
2008
Springer
15 years 12 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...