Sciweavers

463 search results - page 43 / 93
» The lattice dimension of a graph
Sort
View
COMBINATORICS
2007
67views more  COMBINATORICS 2007»
14 years 9 months ago
Directed Animals and Gas Models Revisited
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert
PERCOM
2006
ACM
15 years 9 months ago
Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of ...
Evangelos Kranakis, Tim Mott, Ladislav Stacho
CORR
2007
Springer
138views Education» more  CORR 2007»
14 years 9 months ago
Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity
— ”Extended Clifford algebras” are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two speci...
G. Susinder Rajan, B. Sundar Rajan
PROCEDIA
2010
80views more  PROCEDIA 2010»
14 years 8 months ago
Visualising spins and clusters in regular and small-world Ising models with GPUs
Visualising computational simulation models of solid state physical systems is a hard problem for dense lattice models. Fly throughs and cutaways can aid viewer understanding of a...
Arno Leist, Daniel P. Playne, Kenneth A. Hawick
DCC
2007
IEEE
15 years 9 months ago
Low-density attack revisited
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi ...