Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
An algebraic curve is defined as the zero set of a multivariate polynomial. We consider the problem of fitting an algebraic curve to a set of vectors given an additional set of v...
Christian J. Walder, Brian C. Lovell, Peter J. Koo...
We introduce a semi-supervised support vector machine (S3 VM) method. Given a training set of labeled data and a working set of unlabeled data, S3 VM constructs a support vector m...
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
This paper presents a variational method for supervised texture segmentation, which is based on ideas coming from the curve propagation theory. We assume that a preferable texture...