Sciweavers

134 search results - page 11 / 27
» A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Sort
View
IFIPTCS
2000
14 years 2 months ago
An Index for Two Dimensional String Matching Allowing Rotations
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
TSP
2010
13 years 5 months ago
Sparse channel estimation for multicarrier underwater acoustic communication: from subspace methods to compressed sensing
Abstract--In this paper, we investigate various channel estimators that exploit channel sparsity in the time and/or Doppler domain for a multicarrier underwater acoustic system. We...
Christian R. Berger, Shengli Zhou, James C. Preisi...
CORR
2007
Springer
183views Education» more  CORR 2007»
13 years 10 months ago
Compressed Sensing and Redundant Dictionaries
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
Holger Rauhut, Karin Schnass, Pierre Vandergheynst
SCOPES
2004
Springer
14 years 3 months ago
Instruction Selection for Compilers that Target Architectures with Echo Instructions
Echo Instructions have recently been introduced to allow embedded processors to provide runtime decompression of LZ77-compressed programs at a minimal hardware cost compared to oth...
Philip Brisk, Ani Nahapetian, Majid Sarrafzadeh
JGAA
2007
135views more  JGAA 2007»
13 years 10 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento