Sciweavers

10146 search results - page 470 / 2030
» Fast FAST
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 11 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
SIGGRAPH
1998
ACM
15 years 11 months ago
NeuroAnimator: Fast Neural Network Emulation and Control of Physics-based Models
Radek Grzeszczuk, Demetri Terzopoulos, Geoffrey E....
SIGGRAPH
1998
ACM
15 years 11 months ago
Fast Calculation of Soft Shadow Textures Using Convolution
Cyril Soler, François X. Sillion
SPAA
1998
ACM
15 years 11 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
EUROCRYPT
1998
Springer
15 years 11 months ago
Fast Batch Verification for Modular Exponentiation and Digital Signatures
Mihir Bellare, Juan A. Garay, Tal Rabin