Sciweavers

1272 search results - page 67 / 255
» Approximate Parameterized Matching
Sort
View
DAM
2006
136views more  DAM 2006»
14 years 11 months ago
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization,
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
Taneli Mielikäinen, Esko Ukkonen
CISS
2010
IEEE
14 years 2 months ago
Turbo reconstruction of structured sparse signals
—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by h...
Philip Schniter
DSD
2005
IEEE
123views Hardware» more  DSD 2005»
15 years 4 months ago
Hardware-Based Implementation of the Common Approximate Substring Algorithm
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...
Kenneth B. Kent, Sharon Van Schaick, Jacqueline E....
PR
2002
112views more  PR 2002»
14 years 11 months ago
Finding approximate palindromes in strings
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...
Alexandre H. L. Porto, Valmir C. Barbosa
ISMIR
2005
Springer
139views Music» more  ISMIR 2005»
15 years 4 months ago
Classifier Combination for Capturing Musical Variation
At its heart, music information retrieval is characterized by the need to find the similarity between pieces of music. However, “similar” does not mean “the same”. Theref...
Jeremy Pickens