The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
Data-driven animation has become the industry standard for computer games and many animated movies and special effects. In particular, motion capture data recorded from live actor...
Eamonn J. Keogh, Themis Palpanas, Victor B. Zordan...
Data sets with a large number of nominal variables, some with high cardinality, are becoming increasingly common and need to be explored. Unfortunately, most existing visual explo...
Geraldine E. Rosario, Elke A. Rundensteiner, David...
Representation of relative spatial relations between objects is required in many multimedia database applications. Quantitative representation of spatial relations taking into acc...