Greedy Algorithm For SNRFAI97 A greedy algorithm for computing approximate Median Strings F....  Home/Search
Context
Related
| iti.upv.es/~prhlt/...sacuberta97a.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iti.upv.es/~prhlt/PAPERS...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A string that minimizes the sum of distances to each string of a given set is known as (Generalized) Median String of the set. This concept is important in Pattern Recognition for modeling a (large) set of garbled strings or patterns. The search of such a string is a NP-Hard problem and, therefore, only efficient algorithms for approximate Median Strings can be designed. An efficient greedy approach is proposed here to compute an approximate Median String of a set of strings. This approach ... (Update)
Active bibliography (related documents): More All
0.5: Towards Formal Structural Representation of Spoken Language: An.. - Gutkin (2005) (Correct)
0.3: Similarity-preserving Metrics for Amino-acid Sequences - Poster Igor (2002) (Correct)
0.1: Use of Median String for Classification - Martínez-Hinarejos, Juan, .. (2000) (Correct)
Similar documents based on text: More All
0.3: Optimal Linguistic Decoding is a Difficult Computational.. - Casacuberta, Higuera (1999) (Correct)
0.3: An off-line HTK-based OCR system for isolated.. - Domenech.. (2001) (Correct)
0.3: A Search Procedure for Statistical Translation - Varea, Casacuberta (1997) (Correct)
BibTeX entry: (Update)
@misc{ for-unknown,
author = "Greedy Algorithm For",
title = "Unknown",
url = "citeseer.ist.psu.edu/701900.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
270 The string-to-string Correction Problem (context) - Wagner, Fisher - 1974
114 Finding Approximate Patterns in Strings (context) - Ukkonen - 1985
6 The topology of strings: two NP-Complete Problems (context) - Higuera, Casacuberta
3 Median Strings (context) - Kohonen - 1985
1 Multiple Template Modelling of Sublexical Units in Speech Re.. (context) - Aibar, Castro et al. - 1991
1 La Cadena Media y la Modelizaci'on Ac'ustica (context) - de Antonio - 1996
1 A Fast Algorithm for Finding a Set Median (context) - Juan - 1996
1 Universitat de Val`encia (context) - Rulot, de Inferencia et al. - 1992
1 School of Electronic Eng (context) - Stephen, Tec et al. - 1992
Documents on the same site (http://www.iti.upv.es/~prhlt/PAPERS/papers96-00/papers.html): More
On the Use of Normalized Edit Distances and an Efficient k-NN.. - Juan, Vidal (2000) (Correct)
A Search Procedure for Statistical Translation - Varea, Casacuberta (1997) (Correct)
A Cluster-Based Merging Strategy for Nearest Prototype.. - Mollineda, Ferri, Vidal (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC