Department of Computer Science

DSpace/Manakin Repository

Department of Computer Science


Collections in this community

Recent Submissions

  • Maurer, Peter M.
    We show that any non-singular nxn matrix of order p[superscript n]-1 over GF(p) is a generator of a matrix representation of GF(p[superscript n]). We also determine the number of matrix representations of GF(p[superscript ...
  • Hess, Rachel N.
    This technical report discusses some of the aspects of error detection using finite fields.
  • Drake, Jonathan, 1989- (, )
    The popular k-means algorithm is used to discover clusters in vector data automatically. We present three accelerated algorithms that compute exactly the same clusters much faster than the standard method. First, we redesign ...
  • Berciu, Radu Mihai. (, )
    The goal of this thesis is bringing closer together the game theoretic approach of creating incentives with the requirements and properties of P2P systems. Briefly, we detail the P2P system context that incentive mechanisms ...
  • Maurer, Peter M.
    The general linear groups over GF(2) have an intricate and interesting structure. This report does some preliminary work in examining the structure of two of these groups by giving the conjugacy classes of 3x3 and 4x4 ...

Search BEARdocs

Advanced Search


My Account


RSS Feeds