6045 search results - page 1189 / 1209 » Computable Linearizations of Well-partial-orderings |
SIGMOD
1997
ACM
13 years 12 months ago
1997
ACM
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
FC
1997
Springer
13 years 12 months ago
1997
Springer
Abstract. SPEED is a private key block cipher. It supports three variable parameters: (1) data length — the length of a plaintext/ciphertext of SPEED can be 64, 128 or 256 bits. ...
HPCN
1997
Springer
13 years 12 months ago
1997
Springer
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
STOC
2010
ACM
13 years 12 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
FSE
1994
Springer
13 years 11 months ago
1994
Springer
This paper shows that the actual proposal for an unbalanced Feistel network by Schneier and Blaze is as vulnerable to differential cryptanalysis as the DES. 1 McGuffin Schneier and...