80 search results - page 2 / 16 » A natural lattice basis problem with applications |
C3S2E
2011
ACM
12 years 9 months ago
2011
ACM
The LLL algorithm is a well-known and widely used lattice basis reduction algorithm. In many applications, its speed is critical. Parallel computing can improve speed. However, th...
VMCAI
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a B...
STACS
2009
Springer
14 years 12 days ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
NIPS
2008
13 years 7 months ago
2008
We introduce a novel framework for estimating vector fields using sparse basis field expansions (S-FLEX). The notion of basis fields, which are an extension of scalar basis functi...
SIGSOFT
1998
ACM
13 years 10 months ago
1998
ACM
The design of a class hierarchy may be imperfect. For example, a class C may contain a member m not accessed in any C-instance, an indication that m could be eliminated, or moved ...