Sciweavers

7758 search results - page 55 / 1552
» On the Number of Distributive Lattices
Sort
View
DCG
1999
81views more  DCG 1999»
13 years 8 months ago
Properties of Random Triangulations and Trees
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
Luc Devroye, Philippe Flajolet, Ferran Hurtado, Ma...
ISITA
2010
13 years 6 months ago
Lattice-reduction aided HNN for vector precoding
In this paper we propose a modication of the Hopeld neural networks for vector precoding, based on Lenstra, Lenstra, and Lov`asz lattice basis reduction. This precoding algorithm c...
Vesna Gardasevic, Ralf R. Müller, Daniel J. R...
COCOON
2011
Springer
12 years 8 months ago
Proper n-Cell Polycubes in n - 3 Dimensions
A d-dimensional polycube of size n is a connected set of n cubes in d dimensions, where connectivity is through (d−1)-dimensional faces. Enumeration of polycubes, and, in particu...
Andrei Asinowski, Gill Barequet, Ronnie Barequet, ...
SP
2006
IEEE
193views Security Privacy» more  SP 2006»
14 years 2 months ago
Analysis of the Linux Random Number Generator
Linux is the most popular open source project. The Linux random number generator is part of the kernel of all Linux distributions and is based on generating randomness from entrop...
Zvi Gutterman, Benny Pinkas, Tzachy Reinman
EJC
2010
13 years 8 months ago
Connectivity of chamber graphs of buildings and related complexes
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
Anders Björner, Kathrin Vorwerk