Sciweavers

925 search results - page 23 / 185
» Connectivity on Complete Lattices
Sort
View
ICRA
2010
IEEE
66views Robotics» more  ICRA 2010»
14 years 10 months ago
Strength analysis of miniature folded right angle tetrahedron chain Programmable Matter
Abstract— Miniaturization of Programmable Matter is a major challenge. Much of the difficulty stems from size and power requirements of internal actuators. This paper demonstrat...
Paul J. White, Michael L. Posner, Mark Yim
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
13 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...
JUCS
2007
120views more  JUCS 2007»
14 years 11 months ago
Hamiltonicity of Topological Grid Graphs
: In this paper we study connectivity and hamiltonicity properties of the topological grid graphs, which are a natural type of planar graphs associated with finite subgraphs of th...
Christina Zamfirescu, Tudor Zamfirescu
IJBC
2002
65views more  IJBC 2002»
14 years 11 months ago
On the Templates Corresponding to Cycle-Symmetric Connectivity in Cellular Neural Networks
In the architecture of cellular neural networks (CNN), connections among cells are built on linear coupling laws. These laws are characterized by the so-called templates which exp...
Chih-Wen Shih, Chih-Wen Weng
FPGA
1998
ACM
142views FPGA» more  FPGA 1998»
15 years 4 months ago
A Hybrid Complete-Graph Partial-Crossbar Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose