Sciweavers

1154 search results - page 31 / 231
» On the editing distance of graphs
Sort
View
RIAO
2007
13 years 10 months ago
Optimizations of Local Edition for Evaluating Similarity Between Monophonic Musical Sequences
Abstract: Melody is an important property for the perceptual description of Western musical pieces. In the monophonic context, retrieval systems based on melodic similarity general...
Pierre Hanna, Pascal Ferraro
ICML
2010
IEEE
13 years 9 months ago
Fast Neighborhood Subgraph Pairwise Distance Kernel
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...
Fabrizio Costa, Kurt De Grave
COCOON
2003
Springer
14 years 1 months ago
Genomic Distances under Deletions and Insertions
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome ev...
Mark Marron, Krister M. Swenson, Bernard M. E. Mor...
FOCS
2005
IEEE
14 years 2 months ago
Nonembeddability theorems via Fourier analysis
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 â...
Subhash Khot, Assaf Naor
JIIS
2008
95views more  JIIS 2008»
13 years 8 months ago
Approximate schemas, source-consistency and query answering
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
Michel de Rougemont, Adrien Vieilleribière