The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
The algebraic hierarchical decomposition of finite state automata can be applied wherever a finite system should be `understood' using a hierarchical coordinate system. Here ...
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
The estimation of multiple orientations in multidimensional signals is a strongly non-linear problem to which a two-step solution is here presented. First, the problem is lineariz...