We introduce a convex relaxation framework to optimally
minimize continuous surface ratios. The key idea is to minimize
the continuous surface ratio by solving a sequence
of con...
Kalin Kolev (University of Bonn), Daniel Cremers (...
Incorporating background knowledge into data mining algorithms is an important but challenging problem. Current approaches in semi-supervised learning require explicit knowledge p...
Samah Jamal Fodeh, William F. Punch, Pang-Ning Tan
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
This paper deals with the problem of controlling highly dynamic mechatronic systems. Such systems may work in several different operation modes, or even underlie continuous mode c...
Klaus Ecker, Andrei Tchernykh, Frank Drews, Silke ...
Background: Alignments of homologous DNA sequences are crucial for comparative genomics and phylogenetic analysis. However, multiple alignment represents a computationally difficu...