418 search results - page 27 / 84 » A relaxation-based algorithm for solving the conditional p-c... |
140
Voted
CVPR
2009
IEEE
16 years 11 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...
142
Voted
SIAMSC
2010
15 years 2 months ago
2010
Abstract. Popular approaches for solving the shallow water equations (SWE) for climate modeling are explicit and semi-implicit methods, both have certain constraints on the time st...
137
click to vote
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and tr...
130
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper investigates the problem of causal observability of the states and unknown inputs of nonlinear time-delay systems. Using the theory of non-commutative rings, the nonline...
150
click to vote
JMLR
2012
13 years 6 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...