1026 search results - page 101 / 206 » On Finding Minimal w-cutset |
753
click to vote
Tutorial
Correlation based matching typically produces dense depth maps by calculating the disparity at each pixel within a neighborhood. This is achieved by taking a square window of certa...
150
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The importance of finding the characteristics leading to either a success or a failure is one of the driving forces of data mining. The various application areas of finding succes...
151
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
163
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
177
click to vote
EOR
2008
15 years 6 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...