Sciweavers

78 search results - page 12 / 16
» Adaptive Methods for Linear Programming Decoding
Sort
View
CP
2005
Springer
15 years 3 months ago
Approximations in Distributed Optimization
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
Adrian Petcu, Boi Faltings
CVPR
2010
IEEE
15 years 6 months ago
Estimation of Image Bias Field with Sparsity Constraints
We propose a new scheme to estimate image bias field through introducing two sparsity constraints. One is that the bias-free image has concise representation with image gradients o...
Yuanjie Zheng and James C. Gee
ASPLOS
2009
ACM
15 years 10 months ago
QR decomposition on GPUs
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...
Andrew Kerr, Dan Campbell, Mark Richards
SIGPRO
2010
135views more  SIGPRO 2010»
14 years 8 months ago
A short note on compressed sensing with partially known signal support
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
Laurent Jacques
JCST
2006
99views more  JCST 2006»
14 years 9 months ago
A Dialectal Chinese Speech Recognition Framework
Abstract A framework for dialectal Chinese speech recognition is proposed and studied, in which a relatively small dialectal Chinese (or in other words Chinese influenced by the na...
Jing Li, Thomas Zheng, William Byrne, Daniel Juraf...