Sciweavers

1898 search results - page 219 / 380
» Weak Keys for IDEA
Sort
View
SIAMIS
2010
141views more  SIAMIS 2010»
13 years 4 months ago
Optimization by Stochastic Continuation
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Marc C. Robini, Isabelle E. Magnin
SIAMSC
2010
104views more  SIAMSC 2010»
13 years 4 months ago
BDDC Preconditioners for Spectral Element Discretizations of Almost Incompressible Elasticity in Three Dimensions
Abstract. BDDC algorithms are constructed and analyzed for the system of almost incompressible elasticity discretized with Gauss-Lobatto-Legendre spectral elements in three dimensi...
Luca F. Pavarino, Olof B. Widlund, Stefano Zampini
TSMC
2010
13 years 4 months ago
A Model for the Integration of Prioritized Knowledge Bases Through Subjective Belief Games
Belief merging is concerned with the integration of several belief bases such that a coherent belief base is developed. Various belief merging models have been developed that use a...
Ebrahim Bagheri, Ali A. Ghorbani
PVLDB
2011
13 years 1 months ago
Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores
Adaptive indexing is characterized by the partial creation and refinement of the index as side effects of query execution. Dynamic or shifting workloads may benefit from prelimi...
Stratos Idreos, Stefan Manegold, Harumi A. Kuno, G...
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
12 years 10 months ago
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...