Sciweavers

463 search results - page 9 / 93
» The lattice dimension of a graph
Sort
View
TIT
1998
90views more  TIT 1998»
13 years 10 months ago
On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
Amir H. Banihashemi, Amir K. Khandani
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 5 months ago
Effect of network structure on the stability margin of large vehicle formation with distributed control
We study the problem of distributed control of a large network of double-integrator agents to maintain a rigid formation. A few lead vehicles are given information on the desired t...
He Hao, Prabir Barooah, J. J. P. Veerman
GD
2003
Springer
14 years 4 months ago
Visualizing Related Metabolic Pathways in Two and a Half Dimensions
We propose a method for visualizing a set of related metabolic pathways using 21 2 D graph drawing. Interdependent, twodimensional layouts of each pathway are stacked on top of eac...
Ulrik Brandes, Tim Dwyer, Falk Schreiber
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
IPL
2007
81views more  IPL 2007»
13 years 10 months ago
Linear-time algorithms for problems on planar graphs with fixed disk dimension
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
Faisal N. Abu-Khzam, Michael A. Langston