219 search results - page 2 / 44 » Combinatorial Complexity of Regular Languages |
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
CONSTRAINTS
2008
13 years 11 months ago
2008
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
IJCAI
2007
14 years 8 days ago
2007
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...
DCG
2008
13 years 11 months ago
2008
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
FUIN
2010
13 years 9 months ago
2010
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...