843 search results - page 78 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
151
click to vote
HSNMC
2003
Springer
15 years 6 months ago
2003
Springer
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
114
click to vote
RSS
2007
15 years 2 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
115
click to vote
MP
2006
15 years 1 months ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
102
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
CORR
2010
Springer
15 years 3 days ago
2010
Springer
Optimum implementation of non-conventional wells allows us to increase considerably hydrocarbon recovery. By considering the high drilling cost and the potential improvement in we...