Sciweavers

1449 search results - page 32 / 290
» Finiteness results for sigmoidal
Sort
View
TCOM
2008
155views more  TCOM 2008»
14 years 11 months ago
Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: a finite geometry approach
This paper presents five methods for constructing nonbinary LDPC codes based on finite geometries. These methods result in five classes of nonbinary LDPC codes, one class of cyclic...
Lingqi Zeng, Lan Lan, Ying Yu Tai, Bo Zhou, Shu Li...
CSL
2007
Springer
15 years 6 months ago
The Power of Counting Logics on Restricted Classes of Finite Structures
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
Anuj Dawar, David Richerby
DALT
2005
Springer
15 years 5 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
IBPRIA
2009
Springer
15 years 4 months ago
Variable Order Finite-Context Models in DNA Sequence Coding
Abstract. Being an essential key in biological research, the DNA sequences are often shared between researchers and digitally stored for future use. As these sequences grow in volu...
Daniel A. Martins, António J. R. Neves, Arm...
DM
2011
238views Education» more  DM 2011»
14 years 6 months ago
A combinatorial approach to height sequences in finite partially ordered sets
Fix an element x of a finite partially ordered set P on n elements. Then let hi(x) be the number of linear extensions of P in which x is in position i, counting from the bottom. T...
Csaba Biró, William T. Trotter