2182 search results - page 295 / 437 » A Robust Algorithm for Solving Nonlinear Programming Problem... |
114
click to vote
NIPS
2008
15 years 4 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
121
Voted
ASPDAC
2009
ACM
15 years 9 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
119
Voted
JMLR
2006
15 years 2 months ago
2006
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
140
Voted
EMNLP
2010
15 years 17 days ago
2010
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
114
Voted
FIW
2009
15 years 10 days ago
2009
One of the most difficult tasks in software development is that features are implemented by changing the code of other features. This problem cannot be solved with existing general...