Sciweavers

274 search results - page 1 / 55
» Counting lattice vectors
Sort
View
JCSS
2007
88views more  JCSS 2007»
13 years 4 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ...
Denis Xavier Charles
ACL
2010
13 years 2 months ago
A Generalized-Zero-Preserving Method for Compact Encoding of Concept Lattices
Constructing an encoding of a concept lattice using short bit vectors allows for efficient computation of join operations on the lattice. Join is the central operation any unifica...
Matthew Skala, Victoria Krakovna, János Kra...
EUROPAR
2010
Springer
13 years 5 months ago
Parallel Enumeration of Shortest Lattice Vectors
Abstract. Lattice basis reduction is the problem of finding short vectors in lattices. The security of lattice based cryptosystems is based on the hardness of lattice reduction. Fu...
Özgür Dagdelen, Michael Schneider 0002
JCB
1998
105views more  JCB 1998»
13 years 4 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
IFSA
2007
Springer
159views Fuzzy Logic» more  IFSA 2007»
13 years 11 months ago
Counting Finite Residuated Lattices
We study finite residuated lattices with up to 11 elements. We present an algorithm for generating all non-isomorphic finite residuated lattices with a given number of elements. ...
Radim Belohlávek, Vilém Vychodil