Abstract. We present a technique for discovering and representing changes between versions of data warehouse structures. We select a tree comparison algorithm, adapt it for the par...
The power iteration is a classical method for computing the eigenvector associated with the largest eigenvalue of a matrix. The subspace iteration is an extension of the power iter...
This paper proposes a rerouting scheme that can be applied to the restoration of working Label Switched Paths (LSPs) and preprovisioned backup LSPs, which consists of two subsequen...
Ordering information is a difficult but a important task for natural language generation applications. A wrong order of information not only makes it difficult to understand, but a...
A novel robust active appearance model (AAM) matching algorithm is presented. The method consists of two main stages. First, initial residuals are clustered by a non parametric mea...
Reinhard Beichel, Horst Bischof, Franz Leberl, Mil...