925 search results - page 4 / 185 » Connectivity on Complete Lattices |
PG
2003
IEEE
13 years 10 months ago
2003
IEEE
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...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
ISCI
2010
13 years 3 months ago
2010
The t-concept lattice is introduced as a set of triples associated to graded tabular information interpreted in a non-commutative fuzzy logic. Following the general techniques of ...
IGPL
2011
12 years 12 months ago
2011
In this note we present a completion for the variety of bounded distributive quasi lattices, and, inspired by a well-known idea of L.L. Maksimova [14], we apply this result in prov...
DCG
2008
13 years 5 months ago
2008
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that t...