نتایج جستجو برای: edit distance

تعداد نتایج: 242096  

2015
RYAN S. BAKER Michel C. Desmarais Ryan S. Baker Agathe Merceron Mykola Pechenizkiy Tommi Kärkkäinen Jiangang Hao Zhan Shu Kristy Elizabeth Boyer Jean-Guy Blais Emma Brunskill Janice D. Gobert Jose Maria Luna

2017
Iva Barisic Tyler Thrash Victor R. Schinazi Christoph Hölscher

Wayfinders in a group can be influenced by various factors, including other group members and environmental structure, but social wayfinding is an underexplored topic. This experiment investigated differences in wayfinding decisions between individuals and groups and their dependence on environmental structure. Participants navigated through a train station with or without market stalls, either...

Journal: :Journal of computational biology : a journal of computational molecular cell biology 2009
Aleksandar Stojmirovic Yi-Kuo Yu

We introduce a geometric framework suitable for studying the relationships among biological sequences. In contrast to previous works, our formulation allows asymmetric distances (quasi-metrics), originating from uneven weighting of strings, which may induce non-trivial partial orders on sets of biosequences. The distances considered are more general than traditional generalized string edit dist...

Journal: :Foundations of Computational Mathematics 2020

2004
Michel Neuhaus Horst Bunke

Graph edit distance is a powerful error-tolerant similarity measure for graphs. For pattern recognition problems involving large graphs, however, the high computational complexity makes it sometimes impossible to apply edit distance algorithms. In the present paper we propose an efficient algorithm for edit distance computation of planar graphs. Given graphs embedded in the plane, we iterativel...

2006
Michel Neuhaus Kaspar Riesen Horst Bunke

Graph edit distance is one of the most flexible mechanisms for error-tolerant graph matching. Its key advantage is that edit distance is applicable to unconstrained attributed graphs and can be tailored to a wide variety of applications by means of specific edit cost functions. Its computational complexity, however, is exponential in the number of vertices, which means that edit distance is fea...

2012
Mengqiu Wang Daniel M. Cer

This paper describes Stanford University’s submission to SemEval 2012 Semantic Textual Similarity (STS) shared evaluation task. Our proposed metric computes probabilistic edit distance as predictions of semantic similarity. We learn weighted edit distance in a probabilistic finite state machine (pFSM) model, where state transitions correspond to edit operations. While standard edit distance mod...

Journal: :Computer Vision and Image Understanding 1999
Donald A. Adjeroh Moon-Chuen Lee Irwin King

Video is a unique multimedia data type, in that it comes with distinguished spatio-temporal constraints. Content-based video retrieval thus requires methods for video sequence-to-sequence matching, incorporating the temporal ordering inherent in a video sequence, without losing sight of the visual nature of the information in the sequence. Such methods will require reliable measures of similari...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید