Browsing Graduate School by Author "Hamerly, Gregory James, 1977-"

DSpace/Manakin Repository

BEARdocs is currently undergoing a scheduled upgrade. We expect the upgrade to be completed no later than Monday, March 2nd, 2015. During this time you will be able to access existing documents, but will not be able to log in or submit new documents.

Browsing Graduate School by Author "Hamerly, Gregory James, 1977-"

Sort by: Order: Results:

  • Chiam, Tak Chien. (, )
    Facial age estimation from images is a difficult problem, both because it is naturally difficult to tell the exact age of a person visually, and because of the variations in images, such as illumination, pose, and expression. ...
  • Johnston, Joshua Benjamin.
    In computer architecture, researchers compare new processor designs by simulating them in software. Because simulation is slow, researchers simulate small parts of a workload to save time. The widely successful SimPoint ...
  • 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 ...
  • Yin, Bing, 1985-
    We present an algorithm called HS-means, which is able to learn the number of clusters in a mixture model based on the hierarchical analysis of clustering stability. Our method extends the concept of clustering stability ...
  • Montañez, George D. (, )
    To accurately measure the amount of information a genetic algorithm can generate, we must first measure the amount of information one can store, using a fitness map. The amount of information generated, minus the storage ...
  • 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 ...
  • 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 ...

Search BEARdocs

Advanced Search


My Account