4843 search results - page 176 / 969 » The Shortcut Problem - Complexity and Approximation |
134
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
96
Voted
ICCAD
2007
IEEE
16 years 5 days ago
2007
IEEE
Abstract— Typical nonlinear model order reduction approaches need to address two issues: reducing the order of the model, and approximating the vector field. In this paper we fo...
121
click to vote
CPM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
121
click to vote
ICAC
2007
IEEE
15 years 9 months ago
2007
IEEE
—A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online op...
129
click to vote
JDA
2008
15 years 3 months ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...