1154 search results - page 9 / 231 » On the editing distance of graphs |
ICANNGA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The Levenstein or edit distance was developed as a metric for calculating distances between character strings. We are looking at weighting the different edit operations (...
WIA
2000
Springer
14 years 5 days ago
2000
Springer
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
ECML
2006
Springer
14 years 9 days ago
2006
Springer
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...
193
click to vote
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
NLPRS
2001
Springer
14 years 1 months ago
2001
Springer
This paper describes a method of extracting katakana words and phrases, along with their English counterparts from non-aligned monolingual web search engine query logs. The method...