U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Search Publications by: Brian D. Cloteaux (Fed)

Search Title, Abstract, Conference, Citation, Keyword or Author
Displaying 26 - 39 of 39

Matching Observed Alpha Helix Lengths to Predicted Secondary Structure

October 11, 2010
Author(s)
Brian D. Cloteaux
Because of the complexity in determining the 3D structure of a protein, the use of partial information determined from experimental techniques can greatly reduce the overall computational expense. We investigate the problem of matching experimentally

An Approximation Algorithm for the Coefficients of the Reliability Polynomial

March 15, 2010
Author(s)
Brian D. Cloteaux, Isabel M. Beichl, F Sullivan
The reliability polynomial gives the probability that a graph remains connected given that each edge in it can fail independently with a probability p. While in general determining the coefficients of this polynomial is #P-complete, we give a randomized

A Structural Approach to the Temporal Modeling of Networks

December 14, 2009
Author(s)
Brian D. Cloteaux, Isabel M. Beichl
Simulation of many dynamic real world systems such as the Internet and social networks requires developing dynamic models for the underlying networks in these systems. Currently, there is a large body of work devoted towards determining the underlying

Matching Observed Alpha Helix Lengths to Predicted Secondary Structure

November 1, 2009
Author(s)
Brian D. Cloteaux, Nadezhda Serova
Because of the complexity in determining the 3D structure of a protein, the use of partial information determined from experimental techniques can greatly reduce the overall computational expense. We investigate the problem of matching experimentally

Lower Bounds for Accessing Information on Pure Pointer Machines

July 13, 2009
Author(s)
Brian D. Cloteaux, Desh Ranjan
We study the complexity of representing an array on a Pure Pointer Machine (PPM) or a pointer machine without arithmetic capabilities. In particular, we show that lower bounds in access time for information retrieval on a PPM arise from two different

Measuring the Effectiveness of the s-Metric to Produce Better Network Models

December 7, 2008
Author(s)
Isabel M. Beichl, Brian D. Cloteaux
Recent research has shown that while many complex networks follow a power-law distribution for their vertex degrees, it is not sufficient to model these networks based only on their degree distribution. In order to better distinguish between these networks

Generating Network Models Using the S-Metric

July 14, 2008
Author(s)
Isabel M. Beichl, Brian D. Cloteaux
The ability to create random models of real networks is useful for understanding the interactions of the networks. Several researchers have proposed modeling of complex networks using the degree distribution, the most popular being a power-law distribution