We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
The Baxter number Bn can be written as Bn = n k=0 Θk,n−k−1 with Θk,ℓ = 2 (k + 1)2 (k + 2) k + ℓ k k + ℓ + 1 k k + ℓ + 2 k . These numbers have first appeared in the...
The computation of a shape's orientation is a common task in the area of computer vision and image processing, being used for example to define a local frame of reference and...
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Virtual organisations within and across enterprise structures are becoming mature as a potentially effective means for goal oriented business teamwork. Among the plentyful of supp...