1901 search results - page 135 / 381 » Predicting Program Properties from |
111
click to vote
AI
2008
Springer
15 years 3 months ago
2008
Springer
We propose a novel approach to self-regenerating continuously-operating systems. Such systems provide best-case solutions in security surveillance or decision making centers. We i...
134
click to vote
PAMI
2007
15 years 2 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
142
click to vote
JMLR
2010
15 years 1 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
111
click to vote
SIAMJO
2010
14 years 9 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 ...
127
click to vote
ECOOP
2008
Springer
15 years 4 months ago
2008
Springer
One of the most important decisions about the architecture of a server program is its concurrency mechanisms. However, a good concurrency model for general-purpose server programs ...