Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
We propose a novel semantic video summarization framework, which generates video skimmings that guarantee both the balanced content coverage and the visual coherence. First, we co...
Effective usage of multimedia digital libraries has to deal with the problem of building efficient content annotation and retrieval tools. In this paper Multimedia Ontologies, th...
Andrew D. Bagdanov, Marco Bertini, Alberto Del Bim...
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
: In this paper, we discuss adjustable coverage criteria and their combinations in model-based testing. We formalize coverage criteria and specify test goals using OCL. Then, we pr...
Mario Friske, Bernd-Holger Schlingloff, Stephan We...