Search Constraints

Start Over
Filtering by: Subject Estimation theory -- Data processing Remove constraint Subject: Estimation theory -- Data processing

Search Results

  • Fast algorithms and applications for multi-dimensional least-squares-based minimum variance spectral estimation

    Creator:
    Wei, Lin
    Abstract:
    The main contributions of this thesis are the development and application of four computationally efficient solutions for least-squares-based (LS-based) minimum variance spectral estimation (MVSE). They are: (1) fast computational solution for the 1-D covariance LS-based MVSE, (2) fast computational solution for the 1-D modified covariance LS-based MVSE, (3) fast computational...
    Resource Type:
    Dissertation
    Full Text:
    -resolution spectral estimation can be applied to multi-dimensional data sources with an improved-feature

  • Bitmap Indexing : Energy Applications and Improvements

    Creator:
    McCamish, Benjamin
    Abstract:
    Large databases and data warehouses are becoming prevalent for the storage and management of energy data. Accelerating the rates at which data can be retrieved is beneficial not only to allow for more efficient search of the data, but also to be integrated with other energy system tools. In this...
    Resource Type:
    Masters Thesis
    Full Text:
    : Eduardo J. Cotilla-Sanchez Large databases and data warehouses are becoming prevalent for the storage and

  • Fast Galois field arithmetic for elliptic curve cryptography and error control codes

    Creator:
    Sunar, Berk
    Abstract:
    Today's computer and network communication systems rely on authenticated and secure transmission of information, which requires computationally efficient and low bandwidth cryptographic algorithms. Among these cryptographic algorithms are the elliptic curve cryptosystems which use the arithmetic of finite fields. Furthermore, the fields of characteristic two are preferred since they provide...
    Resource Type:
    Dissertation
    Full Text:
    several applications in coding theory, computer algebra. and cryptography [13, 12]. In these

  • Logic sampling, likelihood weighting and AIS-BN : an exploration of importance sampling

    Creator:
    Wang, Haiou
    Abstract:
    Logic Sampling, Likelihood Weighting and AIS-BN are three variants of stochastic sampling, one class of approximate inference for Bayesian networks. We summarize the ideas underlying each algorithm and the relationship among them. The results from a set of empirical experiments comparing Logic Sampling, Likelihood Weighting and AIS-BN are presented. We...
    Resource Type:
    Masters Thesis
    Full Text:
    . Heckerman Causal Independence for Knowledge Acquisition and Infer- ence In Processing of the Nineth

  • Visualization, implementation, and application of the Walking Tree heuristics for biological string matching

    Creator:
    Cavener, Jeffrey Douglas
    Abstract:
    Biologists need tools to see the structural relationships encoded in biological sequences (strings). The Walking Tree heuristics calculate some of these relationships. I have designed and implemented graphic presentations which allow the biologist (user) to see these relations. This thesis contains background information on the biological sequences and some background...
    Resource Type:
    Masters Thesis
    Full Text:
    contributed to this search for self- knowledge. Theory of computation has dealt with the meaning of knowledge

  • Walking tree methods for biological string matching

    Creator:
    Hsu, Tai C.
    Abstract:
    Approximate string matching is commonly used to align genetic sequences (DNA or RNA) to determine their shared characteristics. In contrast with the standard dynamic programming methods which use local edit distance models, the Walking Tree heuristic method was created to handle non-local changes, e.g., translocations, inversions, and duplications, altogether and...
    Resource Type:
    Dissertation
    Full Text:
    time and space complexities, and produced and analyzed data for the three Chapters, by redesigning the

  • Fast walking tree method via recurrence reduction for biological string alignment

    Creator:
    Oregon State University. Dept. of Computer Science, Hsu, Tai C., and Cull, Paul, 1943-
    Abstract:
    The meaning of biological sequences is a central problem of modern biology. Although string matching is well understood in the edit-distance model, biological strings with transpositions and inversions violate this model's assumptions. To align biologically reasonable strings, we proposed the Walking Tree Method [4,5,6,7,8], an approximate string alignment method that...
    Resource Type:
    Research Paper
    Full Text:
    called text T. Our metaphor is to consider the data structure as a walking tree with |P| leaves, one