Sciweavers

327 search results - page 3 / 66
» On the structure of the Medvedev lattice
Sort
View
PG
2003
IEEE
14 years 19 days ago
Voxelization in Common Sampling Lattices
In this paper we introduce algorithms to voxelize polygonal meshes in common sampling lattices. In the case of Cartesian lattices, we complete the separability and minimality proo...
Haris Widjaya, Torsten Möller, Alireza Enteza...
ICASSP
2011
IEEE
12 years 11 months ago
Two dimensional nested arrays on lattices
In this paper, we develop the theory of a new class of two dimensional arrays with sensors on lattice(s) which can be used to construct a virtual array of much larger size through...
Piya Pal, Palghat P. Vaidyanathan
IJPP
2011
99views more  IJPP 2011»
13 years 2 months ago
Regular Lattice and Small-World Spin Model Simulations Using CUDA and GPUs
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 7 months ago
Faster Algorithms for Constructing a Concept (Galois) Lattice
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
Vicky Choi
EJC
2011
13 years 2 months ago
Distributive lattices, polyhedra, and generalized flows
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
Stefan Felsner, Kolja B. Knauer