Sciweavers

925 search results - page 25 / 185
» Connectivity on Complete Lattices
Sort
View
ICFCA
2010
Springer
15 years 4 months ago
A Survey of Hybrid Representations of Concept Lattices in Conceptual Knowledge Processing
A feature of Formal Concept Analysis is the use of the line diagram of the concept lattice to visualize a conceptual space. The line diagram is a specialized form of Hasse diagram ...
Peter W. Eklund, Jean Villerd
JELIA
2004
Springer
15 years 5 months ago
Reasoning About Quantum Systems
Abstract. A new logic is proposed for reasoning about quantum systems. The logic embodies the postulates of quantum physics and it was designed from the semantics upwards by identi...
Paulo Mateus, Amílcar Sernadas
JSAC
2010
91views more  JSAC 2010»
14 years 10 months ago
Constructing low-connectivity and full-coverage three dimensional sensor networks
Abstract—Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k...
Chuanlin Zhang, Xiaole Bai, Jin Teng, Dong Xuan, W...
COCOON
2011
Springer
13 years 11 months ago
Proper n-Cell Polycubes in n - 3 Dimensions
A d-dimensional polycube of size n is a connected set of n cubes in d dimensions, where connectivity is through (d−1)-dimensional faces. Enumeration of polycubes, and, in particu...
Andrei Asinowski, Gill Barequet, Ronnie Barequet, ...
IACR
2011
155views more  IACR 2011»
13 years 11 months ago
Terminating BKZ
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...