Sciweavers

94 search results - page 4 / 19
» Linear Systems over Finite Abelian Groups
Sort
View
CDC
2009
IEEE
117views Control Systems» more  CDC 2009»
14 years 5 days ago
Information dissemination in networks via linear iterative strategies over finite fields
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
Shreyas Sundaram, Christoforos N. Hadjicostis
MKM
2009
Springer
14 years 2 months ago
Finite Groups Representation Theory with Coq
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...
Sidi Ould Biha
MOC
1998
97views more  MOC 1998»
13 years 7 months ago
Euclid's algorithm and the Lanczos method over finite fields
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
Jeremy Teitelbaum
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
Rational streams coalgebraically
Abstract. We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the ...
Jan J. M. M. Rutten
CORR
2004
Springer
117views Education» more  CORR 2004»
13 years 7 months ago
Efficient dot product over word-size finite fields
We want to achieve efficiency for the exact computation of the dot product of two vectors over word size finite fields. We therefore compare the practical behaviors of a wide range...
Jean-Guillaume Dumas