This article addresses the problem of two- and higher dimensional pattern matching, i.e. the identification of instances of a template within a larger signal space, which is a for...
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of ...
Sathiamoorthy Subbarayan, Lucas Bordeaux, Youssef ...
Recently, a number of interesting algorithmic problems have arisen from the emergence, in a number of countries, of kidney exchange schemes, whereby live donors are matched with r...
Suppose a set of arbitrary (unlabeled) images contains frequent occurrences of 2D objects from an unknown category. This paper is aimed at simultaneously solving the following rel...