This paper presents a statistical framework for recognising 2D shapes which are represented as an arrangement of curves or strokes. The approach is a hierarchical one which mixes geometric and symbolic information in a three-layer architecture. Each curve primitive is represented using a point-distribution model which describes how its shape varies over a set of training data. We assign stroke ...

This paper presents a precursory yet novel approach to the question answering task using structural decomposition. Our system first generates linguistic structures such as syntactic and semantic trees from text, decomposes them into multiple fields, then indexes the terms in each field. For each question, it decomposes the question into multiple fields, measures the relevance score of each fiel...

We consider a generalization of the PDB homomorphism abstractions to what is called “structural patterns”. The basic idea is in abstracting the problem in hand into provably tractable fragments of optimal planning, alleviating by that the constraint of PDBs to use projections of only low dimensionality. We introduce a general framework for additive structural patterns based on decomposing the p...

A new class of computational methods, referred to as decomposition methods, has been developed for predicting failure probability of structural and mechanical systems subject to random loads, material properties, and geometry. The methods involve a novel function decomposition that facilitates univariate and bivariate approximations of a general multivariate function, response surface generatio...

The visualization of high-dimensional data is a challenging research topic. Existing approaches can usually be assigned to either relation or value visualizations. Merging approaches from both classes into a single integrated strategy, Structural Decomposition Trees (SDTs) represent a completely novel visualization approach for high-dimensional data. Although this method is new and promising, s...

We compare tractable classes of constraint satisfaction problems (CSPs). We first give a uniform presentation of the major structural CSP decomposition methods. We then introduce a new class of tractable CSPs based on the concept of hypertree decomposition recently developed in Database Theory, and analyze the cost of solving CSPs having bounded hypertree-width. We provide a framework for compa...

We compare tractable classes of constraint satisfaction problems (CSPs). We first give a uniform presentation of the major structural CSP decomposition methods. We then introduce a new class of tractable CSPs based on the concept of hypertree decomposition recently developed in Database Theory. We introduce a framework for comparing parametric decomposition-based methods according to tractabi l...

The authors develop an unified concept for blocks and processes in SDL. The current principles for a structural decomposition of a system into a set of nested block definitions have been applied to SDL processes. This enables a decomposition of processes into contained processes and opens also the possibility of a dynamic creation of such complex structures. From a behavioural point of view thi...

We present in this paper a structural decomposition for linear multivariable singular systems. Such a decomposition has a distinct feature of capturing and displaying all the structural properties, such as the finite and infinite zero structures, invertibility structures, and redundant dynamics of the given system. As its counterpart for non-singular systems, we believe that the technique is a ...