Sciweavers

719 search results - page 21 / 144
» Solving Sparse Linear Constraints
Sort
View
ISBI
2008
IEEE
15 years 11 months ago
Inferring brain dynamics using granger causality on fMRI data
Here we present a scalable method to compute the structure of causal links over large scale dynamical systems that achieves high efficiency in discovering actual functional connec...
Guillermo A. Cecchi, Rahul Garg, A. Ravishankar Ra...
ICML
2008
IEEE
15 years 11 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
CORR
2007
Springer
112views Education» more  CORR 2007»
14 years 10 months ago
Adaptive Methods for Linear Programming Decoding
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
Mohammad H. Taghavi, Paul H. Siegel
62
Voted
ICASSP
2011
IEEE
14 years 2 months ago
Directions-of-arrival estimation using a sparse spatial spectrum model with uncertainty
This paper is concerned with the estimation of the directionsof-arrival (DOA) of narrowband sources using a sparse spatial spectral model, when the model itself is not precise. Wh...
Jimeng Zheng, Mostafa Kaveh
UAI
2008
14 years 12 months ago
Sparse Stochastic Finite-State Controllers for POMDPs
Bounded policy iteration is an approach to solving infinitehorizon POMDPs that represents policies as stochastic finitestate controllers and iteratively improves a controller by a...
Eric A. Hansen