Sciweavers

139 search results - page 16 / 28
» Finding Gale Strings
Sort
View
CRYPTO
1990
Springer
58views Cryptology» more  CRYPTO 1990»
15 years 1 months ago
Structural Properties of One-way Hash Functions
We study the following two kinds of one-way hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former...
Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
LREC
2010
154views Education» more  LREC 2010»
14 years 11 months ago
Information Retrieval of Word Form Variants in Spoken Language Corpora Using Generalized Edit Distance
An important feature of spoken language corpora is existence of different spelling variants of words in transcription. So there is an important problem for linguist who works with...
Siim Orasmaa, Reina Käärik, Jaak Vilo, T...
GECCO
2004
Springer
15 years 3 months ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
FC
1999
Springer
97views Cryptology» more  FC 1999»
15 years 2 months ago
Playing "Hide and Seek" with Stored Keys
In this paper we consider the problem of efficiently locating cryptographic keys hidden in gigabytes of data, such as the complete file system of a typical PC. We describe efficie...
Adi Shamir, Nicko van Someren
MTPP
2010
14 years 7 months ago
A Fast General Parser for Automatic Code Generation
Abstract. The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be c...
Wuu Yang