1369 search results - page 17 / 274 » Lattice computations for random numbers |
MMSEC
2006
ACM
14 years 2 months ago
2006
ACM
This paper presents a theoretical security analysis of lattice data hiding. The security depends on the secrecy of a dither signal that randomizes the codebook. If the same secret...
ADBIS
2007
Springer
14 years 23 days ago
2007
Springer
Query mapping to aggregation lattices is used in order to exploit sub-cube dependencies in multidimensional databases. It is employed in mobile OLAP dissemination systems, in order...
FCT
1991
Springer
14 years 9 days ago
1991
Springer
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
COMBINATORICS
2000
13 years 8 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...