1258 search results - page 59 / 252 » Architecture-driven Problem Decomposition |
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
109
click to vote
SOCO
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The separation of concerns is a fundamental principle in software engineering. Crosscutting concerns are concerns that do not align with hierarchical and block decomposit...
111
click to vote
WG
2005
Springer
15 years 7 months ago
2005
Springer
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
110
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decompositions into cyclic k-fan structured subproblems are shown t...
PKDD
1999
Springer
15 years 5 months ago
1999
Springer
This paper addresses the problem of learning from highly structured data. Speci cally, it describes a procedure, called decomposition, that allows a learner to access automatically...