We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
In this paper novel theory to automate shape modelling is described. The main idea is to develop a theory that is intrinsically defined for curves, as opposed to a finite sample o...
Abstract. This paper presents an algorithm to detect lateral gene transfer (LGT) on the basis of pairwise evolutionary distances. The prediction is made from a likelihood ratio der...
Christophe Dessimoz, Daniel Margadant, Gaston H. G...
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...