We outline a method for measuring in an efficient way an overall degree of similarity between different leaf-labelled trees. In particular, we consider rooted trees, either unorde...
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
In the late eighties, it was shown that juggling patterns can be described by strings of numbers with fascinating combinatorial properties that have since then been studied by man...
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, R...
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...