Sciweavers

416 search results - page 1 / 84
» Simple and Efficient Algorithm for Approximate Dictionary Ma...
Sort
View
COLING
2010
12 years 11 months ago
Simple and Efficient Algorithm for Approximate Dictionary Matching
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
Naoaki Okazaki, Jun-ichi Tsujii
ICIP
2004
IEEE
14 years 6 months ago
Redundant image representations in security applications
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of no...
Philippe Jost, Pierre Vandergheynst, Pascal Frossa...
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
14 years 4 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
TIP
2008
144views more  TIP 2008»
13 years 4 months ago
On Dictionary Adaptation for Recurrent Pattern Image Coding
In this paper, we exploit a recently introduced coding algorithm called multidimensional multiscale parser (MMP) as an alternative to the traditional transform quantization-based m...
Nuno M. M. Rodrigues, Eduardo A. B. da Silva, Muri...
TSP
2010
12 years 11 months ago
Double sparsity: learning sparse dictionaries for sparse signal approximation
Abstract--An efficient and flexible dictionary structure is proposed for sparse and redundant signal representation. The proposed sparse dictionary is based on a sparsity model of ...
Ron Rubinstein, Michael Zibulevsky, Michael Elad