We augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computati...
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
In this paper, we present a new algorithm of snakes with geometric prior. A method of shape alignment using Fourier coefficients is introduced to estimate the Euclidean transform...
In this paper, we introduce a novel algorithm to solve
global shape registration problems. We use gray-scale “images”
to represent source shapes, and propose a novel twocompo...
Hongsheng Li (Lehigh University), Tian Shen (Lehig...
This article proposes an algorithm to automatically learn useful transformations of data to improve accuracy in supervised classification tasks. These transformations take the for...