Sciweavers

2040 search results - page 149 / 408
» Approximate Expectation Maximization
Sort
View
ICML
2005
IEEE
16 years 4 months ago
Near-optimal sensor placements in Gaussian processes
When monitoring spatial phenomena, which are often modeled as Gaussian Processes (GPs), choosing sensor locations is a fundamental task. A common strategy is to place sensors at t...
Carlos Guestrin, Andreas Krause, Ajit Paul Singh
119
Voted
ISBI
2006
IEEE
16 years 4 months ago
A fast and robust ODF estimation algorithm in Q-ball imaging
We propose a simple and straightforward analytic solution for the Q-ball reconstruction of the diffusion orientation distribution function (ODF) of the underlying fiber population...
Maxime Descoteaux, Elaine Angelino, Shaun Fitzgibb...
ICASSP
2008
IEEE
15 years 9 months ago
Maximum entropy relaxation for multiscale graphical model selection
We consider the problem of learning multiscale graphical models. Given a collection of variables along with covariance specifications for these variables, we introduce hidden var...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
118
Voted
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
15 years 9 months ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
WINE
2005
Springer
182views Economy» more  WINE 2005»
15 years 8 months ago
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
Subhash Khot, Richard J. Lipton, Evangelos Markaki...