In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
We present an algorithm for multi-person tracking-bydetection
in a particle filtering framework. To address the
unreliability of current state-of-the-art object detectors, our
a...
Michael D. Breitenstein, Fabian Reichlin, Bastian ...
In this paper we propose a compressed-domain image enhancement algorithm based on color appearance modeling. We aim at providing an efficient high-quality JPEG color image enhancem...
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...