IJAR
2011
13 years 3 months ago
2011
The basic idea of an algebraic approach to learning Bayesian network (BN) structures is to represent every BN structure by a certain uniquely determined vector, called the standar...
MOC
1998
13 years 11 months ago
1998
We count lattice points in certain rational simplices associated with an irreducible finite Weyl group W and observe that these numbers are linked to the exponents of W .
COMBINATORICS
1999
13 years 11 months ago
1999
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...
APPROX
2006
Springer
14 years 3 months ago
2006
Springer
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...