A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
French is known to be a language with major pronunciation irregularities at word endings with consonants. Particularly, the well-known phonetic phenomenon called Liaison is one of...
This paper addresses a geometrically invariant watermarking method for digital images. Most previous watermarking algorithms perform weakly against geometric distortions, which des...
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
The availability of large files of manuallyreviewed parse trees from the University of Pennsylvania "tree bank", along with a program for comparing system-generated pars...