Sciweavers

158 search results - page 11 / 32
» Simple Fast Parallel Hashing
Sort
View
ASAP
2005
IEEE
96views Hardware» more  ASAP 2005»
14 years 2 months ago
On-Chip Lookup Tables for Fast Symmetric-Key Encryption
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...
A. Murat Fiskiran, Ruby B. Lee
3DPVT
2002
IEEE
121views Visualization» more  3DPVT 2002»
14 years 1 months ago
Analysis of Secondary Structure Elements of Proteins Using Indexing Techniques
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...
Concettina Guerra, Stefano Lonardi, Giuseppe Zanot...
CORR
2008
Springer
170views Education» more  CORR 2008»
13 years 8 months ago
Fast Wavelet-Based Visual Classification
We investigate a biologically motivated approach to fast visual classification, directly inspired by the recent work [13]. Specifically, trading-off biological accuracy for comput...
Guoshen Yu, Jean-Jacques E. Slotine
FMSD
2002
114views more  FMSD 2002»
13 years 8 months ago
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
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 ...
Ruben Gamboa
NIPS
2007
13 years 10 months ago
A learning framework for nearest neighbor search
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...
Lawrence Cayton, Sanjoy Dasgupta