7006 search results - page 433 / 1402 » Approximation Algorithms |
169
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
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...
176
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
144
click to vote
ETT
2007
15 years 4 months ago
2007
Abstract— The performance of the widely applied timedomain channel estimation for SISO- and MIMO-OFDM systems strongly depends on the preciseness of information regarding maximum...
146
Voted
CIMCA
2005
IEEE
15 years 10 months ago
2005
IEEE
We give a fast and practical algorithm for statistical learning hyperparameters from observable data in probabilistic image processing, which is based on Gaussian graphical model ...
142
click to vote
TALG
2010
15 years 3 months ago
2010
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...