Sciweavers

397 search results - page 60 / 80
» Pseudorandom Functions and Lattices
Sort
View
ICCS
2004
Springer
15 years 6 months ago
A Cartesian Closed Category of Approximable Concept Structures
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
Pascal Hitzler, Guo-Qiang Zhang
FSE
2008
Springer
141views Cryptology» more  FSE 2008»
15 years 2 months ago
Cryptanalysis of LASH
We show that the LASH-x hash function is vulnerable to attacks that trade time for memory, including collision attacks as fast as 2(4x/11) and preimage attacks as fast as 2(4x/7) ....
Ron Steinfeld, Scott Contini, Krystian Matusiewicz...
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 1 months ago
Trimmed Moebius Inversion and Graphs of Bounded Degree
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
APIN
2004
107views more  APIN 2004»
15 years 1 months ago
Designing Polymer Blends Using Neural Networks, Genetic Algorithms, and Markov Chains
In this paper we present a new technique to simulate polymer blends that overcomes the shortcomings in polymer system modeling. This method has an inherent advantage in that the v...
N. K. Roy, Walter D. Potter, D. P. Landau
FSS
2010
107views more  FSS 2010»
14 years 11 months ago
Cut approach to islands in rectangular fuzzy relations
The paper investigates fuzzy relations on a finite domain in the cutworthy framework, dealing with a new property coming from the information theory. If the domain of a relation i...
Eszter K. Horváth, Branimir Seselja, Andrej...