Sciweavers

6315 search results - page 269 / 1263
» Approximating Solution Structure
Sort
View
NA
2010
96views more  NA 2010»
15 years 5 months ago
Spectral element methods on unstructured meshes: which interpolation points?
In the field of spectral element approximations, the interpolation points can be chosen on the basis of different criteria, going from the minimization of the Lebesgue constant to ...
Richard Pasquetti, Francesca Rapetti
ICASSP
2011
IEEE
14 years 10 months ago
From maximum likelihood to iterative decoding
Iterative decoding is considered in this paper from an optimization point of view. Starting from the optimal maximum likelihood decoding, a (tractable) approximate criterion is de...
Florence Alberge, Ziad Naja, Pierre Duhamel
CVPR
2010
IEEE
16 years 3 months ago
Beyond Trees: MRF Inference via Outer-Planar Decomposition
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
Dhruv Batra, Andrew Gallagher, Devi Parikh, Tsuhan...
IPPS
2006
IEEE
16 years 20 days ago
On the performance of parallel normalized explicit preconditioned conjugate gradient type methods
A new class of parallel normalized preconditioned conjugate gradient type methods in conjunction with normalized approximate inverses algorithms, based on normalized approximate f...
George A. Gravvanis, Konstantinos M. Giannoutakis
IPSN
2009
Springer
16 years 1 months ago
Near-optimal Bayesian localization via incoherence and sparsity
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
Volkan Cevher, Petros Boufounos, Richard G. Barani...