Sciweavers

20 search results - page 2 / 4
» On Dependency Graphs and the Lattice Gas
Sort
View
FOCS
2006
IEEE
13 years 11 months ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
SIAMDM
2008
50views more  SIAMDM 2008»
13 years 5 months ago
Real Number Channel Assignments for Lattices
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
Jerrold R. Griggs, Xiaohua Teresa Jin
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
13 years 5 months ago
Constructions of Representations of Rank Two Semisimple Lie Algebras with Distributive Lattices
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we ha...
L. Wyatt Alverson II, Robert G. Donnelly, Scott J....
DCC
2011
IEEE
13 years 14 days ago
Sparse Boolean equations and circuit lattices
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
Igor Semaev
ISCA
2000
IEEE
63views Hardware» more  ISCA 2000»
13 years 10 months ago
An embedded DRAM architecture for large-scale spatial-lattice computations
Spatial-lattice computations with finite-range interactions are an important class of easily parallelized computations. This class includes many simple and direct algorithms for ...
Norman Margolus