We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Given two sets of points in the plane, we are interested in locating a highway h such that an objective function on the city distance between points of the two sets is minimized (w...
— The problem of channel code design for the M-ary input AWGN channel with additive discrete interference where the sequence of i.i.d. interference symbols is known causally at t...
Hamidreza Farmanbar, Shahab Oveis Gharan, Amir K. ...
The problem of trajectory similarity has been recently attracted research interest considerably, due to its importance in diverse fields. In this work, we study trajectory similar...
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...