87 search results - page 7 / 18 » Using hashing to solve the dictionary problem |
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision ...
FGR
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper presents a novel framework for recognition of facial action unit (AU) combinations by viewing the classification as a sparse representation problem. Based on this framew...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we consider sparse decomposition (SD) of twodimensional (2D) signals on overcomplete dictionaries with separable atoms. Although, this problem can be solved by conv...