2920 search results - page 53 / 584 » Finite information logic |
MKM
2009
Springer
14 years 4 months ago
2009
Springer
Representation theory is a branch of algebra that allows the study of groups through linear applications, i.e. matrices. Thus problems in abstract groups can be reduced to problems...
CISS
2008
IEEE
14 years 4 months ago
2008
IEEE
—Permutations of order N are generated using polynomials in a Galois field GF(q) where q > N+1, which can be written as a linear transformation on a vector of polynomial coeff...
LATIN
2004
Springer
14 years 3 months ago
2004
Springer
In a preceding paper [6], automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite...
AWIC
2005
Springer
14 years 3 months ago
2005
Springer
This paper presents an approach for applying inductive logic programming to information extraction from HTML documents structured as unranked ordered trees. We consider information...
JNSM
2008
13 years 10 months ago
2008
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...