We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
This paper presents a new technique for approximating range images by means of adaptive triangular meshes with a bounded approximation error and without applying optimization. Thi...
Given an approximate solution to a nonlinear system of equations at which the Jacobi matrix is nonsingular, and given that the Jacobi matrix is continuous in a region about this ap...
The problem of estimating a sparse channel, i.e. a channel with a few non-zero taps, appears in many fields of communication including acoustic underwater or wireless transmissions...
Rad Niazadeh, Massoud Babaie-Zadeh, Christian Jutt...