87 search results - page 6 / 18 » Using hashing to solve the dictionary problem |
ISW
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Chameleon signatures are based on well established hashand-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest. Chameleon s...
IEAAIE
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we propose to apply an NA-tree in the Chord system to encode spatial region data in the data key part used in the hash function to data search. That is, we combine t...
CVPR
2010
IEEE
13 years 11 months ago
2010
IEEE
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
LREC
2010
13 years 9 months ago
2010
In Japanese, there are a large number of notational variants of words. This is because Japanese words are written in three kinds of characters: kanji (Chinese) characters, hiragar...
SIAMIS
2010
13 years 2 months ago
2010
This article proposes a new method for image separation into a linear combination of morphological components. Sparsity in fixed dictionaries is used to extract the cartoon and osc...