Sciweavers

161 search results - page 16 / 33
» Counting Distinct Strings
Sort
View
EUSFLAT
2001
13 years 10 months ago
Similarity measurement on leaf-labelled trees
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...
Hans De Meyer, Bernard De Baets, Saskia Janssens
ICML
2003
IEEE
14 years 9 months ago
Marginalized Kernels Between Labeled Graphs
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 ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi
MST
2006
96views more  MST 2006»
13 years 8 months ago
Juggling with Pattern Matching
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...
Jean Cardinal, Steve Kremer, Stefan Langerman
PODS
2005
ACM
211views Database» more  PODS 2005»
14 years 8 months ago
Join-distinct aggregate estimation over update streams
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...
BIRTHDAY
2010
Springer
13 years 9 months ago
Choiceless Computation and Symmetry
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...
Benjamin Rossman