158 search results - page 11 / 32 » Simple Fast Parallel Hashing |
163
click to vote
ASAP
2005
IEEE
15 years 11 months ago
2005
IEEE
On public communication networks such as the Internet, data confidentiality can be provided by symmetric-key ciphers. One of the most common operations used in symmetric-key ciphe...
168
click to vote
3DPVT
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper we present a method for protein structure comparison that is based on indexing. Unlike most methods using indexing, ours does not use invariants of the C atoms of th...
149
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We investigate a biologically motivated approach to fast visual classification, directly inspired by the recent work [13]. Specifically, trading-off biological accuracy for comput...
151
click to vote
FMSD
2002
15 years 5 months ago
2002
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
136
click to vote
NIPS
2007
15 years 7 months ago
2007
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...