Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
We introduce a new mixed method for the biharmonic problem. The method is based on a formulation where the biharmonic problem is re-written as a system of four first-order equatio...
As the operating frequency increases to Giga Hertz and the rise time of a signal is less than or comparable to the time-of-flight delay of a line, it is necessary to consider the...
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not providing information on the actual object location...
Christoph H. Lampert, Matthew B. Blaschko, Thomas ...