Sciweavers

173 search results - page 6 / 35
» Asymptotic classes of finite structures
Sort
View
APAL
2006
57views more  APAL 2006»
13 years 7 months ago
Effective categoricity of equivalence structures
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
Wesley Calvert, Douglas Cenzer, Valentina S. Hariz...
ICALP
2009
Springer
14 years 7 months ago
Decidability of Conjugacy of Tree-Shifts of Finite Type
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
Nathalie Aubrun, Marie-Pierre Béal
IOR
2008
103views more  IOR 2008»
13 years 7 months ago
Portfolio Credit Risk with Extremal Dependence: Asymptotic Analysis and Efficient Simulation
We consider the risk of a portfolio comprised of loans, bonds, and financial instruments that are subject to possible default. In particular, we are interested in performance meas...
Achal Bassamboo, Sandeep Juneja, Assaf J. Zeevi
AUTOMATICA
2004
77views more  AUTOMATICA 2004»
13 years 7 months ago
Non-asymptotic quality assessment of generalised FIR models with periodic inputs
In any real-life identification problem, only a finite number of data points is available. On the other hand, almost all results in stochastic identification pertain to asymptotic...
Marco C. Campi, Su Ki Ooi, Erik Weyer
TCOM
2008
155views more  TCOM 2008»
13 years 7 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...