Sciweavers

7758 search results - page 14 / 1552
» On the Number of Distributive Lattices
Sort
View
COMBINATORICS
1999
139views more  COMBINATORICS 1999»
13 years 8 months ago
A Closer Look at Lattice Points in Rational Simplices
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...
Matthias Beck
MLMTA
2003
13 years 10 months ago
Improved Experimental Results Using Fuzzy Lattice Neurocomputing (FLN) Classifiers
— This work shows comparatively the capacity of five Fuzzy Lattice Neurocomputing (FLN) classifiers. The mechanics of the five classifiers are illustrated geometrically on the pl...
Al Cripps, Vassilis G. Kaburlasos, Nghiep Nguyen, ...
TIT
1998
90views more  TIT 1998»
13 years 8 months ago
On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
Amir H. Banihashemi, Amir K. Khandani
CW
2002
IEEE
14 years 1 months ago
Free-Form Deformation with Automatically Generated Multiresolution Lattices
Developing intuitive and efficient methods for shape editing is one of the most important areas in computer graphics, and free-form deformation (FFD), which is one of such methods...
Yutaka Ono, Bing-Yu Chen, Tomoyuki Nishita, Jieqin...
LATIN
2010
Springer
14 years 3 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin