107 search results - page 2 / 22 » On derivations of lattices |
ICFCA
2010
Springer
13 years 10 months ago
2010
Springer
This paper discusses results from an experimental study of concept neighbourhoods in WordNet and Roget’s Thesaurus. The general aim of this research is to determine ways in which...
JCT
2008
13 years 5 months ago
2008
The enumeration of lattice paths in wedges poses unique mathematical challenges. These models are not translationally invariant, and the absence of this symmetry complicates both ...
COMBINATORICS
1999
13 years 5 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...
TIT
1998
13 years 5 months ago
1998
—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...
COLING
2008
13 years 7 months ago
2008
In this paper, we describe a new reranking strategy named word lattice reranking, for the task of joint Chinese word segmentation and part-of-speech (POS) tagging. As a derivation...