Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
We present results of our work on using first order theorem proving to reason over a large ontology (the Suggested Upper Merged Ontology ? SUMO), and methods for making SUMO suita...
We propose an autonomous system for personalized production of basketball videos from multi-sensored data under limited display resolution. Especially, we propose criteria for opt...
We consider how to exploit the correlation in image for compression by virtue of studying image patches in a nonparametric manner. Instead of extracting and recording parameters, ...
Abstract. When direct measurement of model parameters is not possible, these need to be inferred indirectly from calibration data. To solve this inverse problem, an algorithm that ...