Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
— In this article a new method is presented to obtain a full and precise calibration of camera-robot systems with eyein-hand cameras. It achieves a simultaneous and numerically s...
Abstract. Substitution matrices are at the heart of Bioinformatics: sequence alignment, database search, phylogenetic inference, protein family classication are based on Blosum, P...
Stephan Kitchovitch, Yuedong Song, Richard C. van ...
— The goal of this paper is to develop modeling techniques for complex systems for the purposes of control, estimation, and inference: (i) A new class of Hidden Markov Models is ...