Sciweavers

241 search results - page 21 / 49
» Lattices and Spherical Designs
Sort
View
ICFCA
2005
Springer
14 years 26 days ago
On Computing the Minimal Generator Family for Concept Lattices and Icebergs
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
Kamal Nehmé, Petko Valtchev, Mohamed Rouane...
ICFCA
2009
Springer
14 years 2 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
APIN
2004
107views more  APIN 2004»
13 years 7 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
CAD
2002
Springer
13 years 7 months ago
Free-form design using axial curve-pairs
Deformation of 3D shapes usually requires the use of a deformation tool. The freeform deformation technique requires the use of a lattice of control point for deforming an object....
K. C. Hui
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
12 years 7 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...