5692 search results - page 168 / 1139 » Challenges and Unsolved Problems |
141
click to vote
JMLR
2006
15 years 4 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
122
Voted
SIAMJO
2010
14 years 10 months ago
2010
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...
145
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
138
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
141
click to vote
CVPR
1999
IEEE
16 years 6 months ago
1999
IEEE
The development of user interfaces based on vision and speech requires the solution of a challenging statistical inference problem: The intentions and actions of multiple individu...