Search Constraints

Start Over
Filtering by: Alternative title ssim Report no. 2186 Remove constraint Alternative title ssim: Report no. 2186 Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Committee Member Wong, Weng-Keen Remove constraint Committee Member: Wong, Weng-Keen

Search Results

  • ThreshKnot: Thresholded ProbKnot for Improved RNA Secondary Structure Prediction

    Creator:
    Zhang, Liang
    Abstract:
    RNA structure prediction is a challenging problem, especially with pseudoknots. Recently, there has been a shift from the classical minimum free energy-based methods (MFE) to partition function-based ones that assemble structures based on base-pairing probabilities. Two typical examples of the latter group are the popular maximum expected accuracy (MEA) method...
    Resource Type:
    Masters Thesis
    Full Text:
    compared to the known structure (see Table SI 1). We also report in Table SI 2 the accuracies using exact

  • A SAT-based planning framework for optimizing resource production

    Creator:
    Ventura, Christopher
    Abstract:
    Domain-independent automated planning is concerned with computing a sequence of actions that can transform an initial state into a desired goal state. Resource production domains form an interesting class of such problems, in that they typically require reasoning about concurrent durative-actions with continuous effects while minimizing some cost function. Although...
    Resource Type:
    Masters Thesis
    Full Text:
    there is no way to generate plans that try to minimize some cost function, which is necessary in

  • Active learning of constraints for semi-supervised clustering

    Creator:
    Xiong, Sicheng
    Abstract:
    Semi-supervised clustering aims to improve clustering performance by considering user supervision in the form of pairwise constraints. In this paper, we study the active learning problem of selecting pairwise must-link and cannot-link constraints for semisupervised clustering. We consider active learning in an iterative manner where in each iteration queries are...
    Resource Type:
    Masters Thesis
    Full Text:
    have cannot-link constraints between one another. Note that if there exists no cannot-link constraints

  • Investigating Latent State and Uncertainty Representations in Reinforcement Learning

    Creator:
    Koul, Anurag
    Abstract:
    Learning latent space representations of high-dimensional world states has been at the core of recent rapid growth in reinforcement learning(RL). At the same time, RL algo- rithms have suffered from ignored uncertainties in the predicted estimates of model-free or model-based methods. In our work, we investigate both of these aspects...
    Resource Type:
    Dissertation
    Full Text:
    (depicted by different colors). The x-axis spans from no(0) coverage to complete(1) coverage of queries and

  • Bayesian optimization with empirical constraints

    Creator:
    Azimi, Javad
    Abstract:
    Bayesian Optimization (BO) methods are often used to optimize an unknown function f(•) that is costly to evaluate. They typically work in an iterative manner. In each iteration, given a set of observation points, BO algorithms select k ≥ 1 points to be evaluated. The results of those points are...
    Resource Type:
    Dissertation
    Full Text:
    ∗ that will produce an output no smaller than (1 + α)ymax (without loss of generality we assume ymax > 0

  • Interpretable Machine Learning: Applications in Biology and Genomics

    Creator:
    Danaee, Padideh
    Abstract:
    Machine learning (ML) and deep learning (DL) models impact our daily lives with applications in natural language modeling, image analysis, healthcare, genomics, and bioinformatics. The exponential growth of biological sequence data necessitates accompanying advances in computational methods. Although deep learning is highly effective for detecting and classifying biological sequences, challenges...
    Resource Type:
    Dissertation
    Full Text:
    annotation indicates that the structure has no bulges at time of writing (http://www.rnasoft. ca/strand