Sciweavers

273 search results - page 7 / 55
» Compressed String Dictionaries
Sort
View
TVLSI
2010
13 years 2 months ago
Test Data Compression Using Efficient Bitmask and Dictionary Selection Methods
Abstract--Higher circuit densities in system-on-chip (SOC) designs have led to drastic increase in test data volume. Larger test data size demands not only higher memory requiremen...
Kanad Basu, Prabhat Mishra
IJON
1998
46views more  IJON 1998»
13 years 7 months ago
Self-organizing maps of symbol strings
SOM and LVQ algorithms for symbol strings have been introduced and applied to isolatedword recognition, for the construction of an optimal pronunciation dictionary for a given spe...
Teuvo Kohonen, Panu Somervuo
DCC
2002
IEEE
14 years 7 months ago
Less Redundant Codes for Variable Size Dictionaries
In this paper, we report work on a family of variable-length codes with less redundancy than the de facto flat code used in most of the variable size dynamic dictionary based comp...
Zhen Yao, Nasir Rajpoot
CORR
2007
Springer
183views Education» more  CORR 2007»
13 years 7 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
ICDE
2012
IEEE
252views Database» more  ICDE 2012»
11 years 10 months ago
Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
Chong Sun, Jeffrey F. Naughton, Siddharth Barman