Sciweavers

177 search results - page 1 / 36
» Analyzing Blockwise Lattice Algorithms Using Dynamical Syste...
Sort
View
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
12 years 11 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...
CPHYSICS
2011
271views Education» more  CPHYSICS 2011»
13 years 2 months ago
A dedicated algorithm for calculating ground states for the triangular random bond Ising model
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
O. Melchert, A. K. Hartmann
ECAI
2004
Springer
14 years 2 months ago
OntoRefiner, a user query refinement interface usable for Semantic Web Portals
We present a user interface, the OntoRefiner1 system, for helping the user to navigate numerous retrieved documents after a search querying a semantic portal which integrates a ver...
Brigitte Safar, Hassen Kefi, Chantal Reynaud
DKE
2002
218views more  DKE 2002»
13 years 11 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
ISPA
2004
Springer
14 years 4 months ago
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell