BEARdocs

Browsing Department of Computer Science by Title

DSpace/Manakin Repository

Browsing Department of Computer Science by Title

Sort by: Order: Results:

  • Feng, Yu.
    We present a novel algorithm called PG-means in this thesis. This algorithm is able to determine the number of clusters in a classical Gaussian mixture model automatically. PG-means uses efficient statistical hypothesis ...
  • Maurer, Peter M.
    This report lists the primitive polynomials over GF(2) of degree 2 through 16. These polynomials were generated using a new matrix-based technique I invented.
  • Maurer, Peter M.
    This report lists the primitive polynomials over GF(3) of degree 2 through 11. These polynomials were generated using a new matrix-based technique I invented.
  • Maurer, Peter M.
    This report gives the details an algorithm for determining whether two matrix groups are conjugate to one another. Each group is designated by a pair of matrices that generate the group. The algorithm is able to determine ...
  • Maurer, Peter M.
    This report gives one subgroup of each of the conjugacy classes of the subgroups of S7.
  • Maurer, Peter M.
    As is well known (or should be well known) the finite field GF(2^k) can be represented in the general linear group of kxk matrices over GF(2). There are many such representations. This report gives the 8 representations ...
  • Maurer, Peter
    It’s clear that traditional forms of academic publication are rapidly becoming obsolete. It’s also clear that peer review is a seriously flawed process that could be much improved upon by modern methods of communication. ...
  • Maurer, Peter M.
    The objective of the algorithm described in this report is to optimally guess a hidden binary string based on queries to an oracle where the length of the string is known beforehand. A C++ version of the algorithm is given ...
  • Maurer, Peter M.
    The shadow algorithm is an event-driven unit-delay simulation technique that has been designed to take advantage of the instruction caches present in many of the latest workstations. The algorithm is based on the threaded-code ...
  • Maurer, Peter M.
    This is the software described in the technical report “The Shadow Algorithm: …” available from this archive. This package is part of the FHDL system and must be installed in your FHDL directory.
  • Ewert, Winston.
    A search process is an attempt to locate a solution to a problem, such as an optimization problem, where the space is usually too large to exhaustively sample. In order to investigate this idea this work looks a three ...
  • Maurer, Peter M.
    This technical report lists all subgroups of S3 in cycle form.
  • Maurer, Peter M.
    This technical report lists all subgroups of S4, the symmetric group of degree 4. Subgroups are listed in cycle form using the integers 0, 1, 2, and 3.
  • Maurer, Peter M.
    This technical report lists all subgroups of S5 in cycle form, using the integers 0-4.
  • Maurer, Peter M.
    This technical report lists all subgroups of S6 in cycle form using the integers 0-5.
  • Maurer, Peter M.
    This report gives all conjugacy classes of the super symmetric groups HR3 and VR3
  • Maurer, Peter M.
    Super symmetry is a type of matrix-based symmetry that extends the concept of total symmetry. Super symmetric functions are “even more symmetric” than totally symmetric functions. Even if a function is not super ...
  • Maurer, Peter M.
    The Inversion Algorithm is an event-driven logic simulation technique that is competitive with Levelized Compiled Code Simulation. Previous versions of the Inversion Algorithm have been limited to purely binary simulation. ...
  • Maurer, Peter M.
    TOKDEC is a tool that helps create compiler debugging code by converting numeric tokens into character strings. It is meant to be used with the output of the “yacc” preprocessor.
  • Maurer, Peter M.
    The PC-set method and the parallel technique are two methods for generating compiled unit-delay simulations of acyclic circuits. The PC-set method analyzes the network, determines the set of potential change times for each ...

Search BEARdocs


Advanced Search

Browse

My Account

Statistics