495 search results - page 53 / 99 » Sparse representation algorithms based on mean-field approxi... |
110
click to vote
SIAMNUM
2010
14 years 5 months ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
TMI
2008
14 years 10 months ago
2008
We introduce a novel algorithm for the design of fast slice-selective spatially-tailored magnetic resonance imaging (MRI) excitation pulses. This method, based on sparse approximat...
79
Voted
CORR
2006
Springer
14 years 10 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
103
click to vote
BMCBI
2010
14 years 10 months ago
2010
Background: Modelling the ligand binding site of a protein is an important component of understanding proteinligand interactions and is being actively studied. Even if the side ch...