Sciweavers

112 search results - page 18 / 23
» On the Homological Dimension of Lattices
Sort
View
DAM
2011
13 years 1 months ago
Weak sense of direction labelings and graph embeddings
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
Christine T. Cheng, Ichiro Suzuki
CORR
2007
Springer
138views Education» more  CORR 2007»
13 years 6 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»
13 years 5 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
14 years 6 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 ...
EMMCVPR
2003
Springer
13 years 12 months ago
Watershed-Based Unsupervised Clustering
In this paper, a novel general purpose clustering algorithm is presented, based on the watershed algorithm. The proposed approach defines a density function on a suitable lattice,...
Manuele Bicego, Marco Cristani, Andrea Fusiello, V...