Search Constraints

Start Over
Filtering by: Creator Whelan, Jean K. Remove constraint Creator: Whelan, Jean K. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Resource placement, data rearrangement, and Hamiltonian cycles in torus networks

    Creator:
    Bae, Myung Mun
    Abstract:
    Many parallel machines, both commercial and experimental, have been/are being designed with toroidal interconnection networks. For a given number of nodes, the torus has a relatively larger diameter, but better cost/performance tradeoffs, such as higher channel bandwidth, and lower node degree, when compared to the hypercube. Thus, the torus is...
    Resource Type:
    Dissertation
    Full Text:
    . The last part of the thesis gives results on generating edge disjoint Hamilto­ nian cycles in k-ary n

  • Topics in toroidal interconnection networks

    Creator:
    Broeg, Robert Richard
    Resource Type:
    Dissertation
    Full Text:
    characterized as a graph that is the cross product of cycles. The graphs of the k-ary n-cube (Qk,,) and the

  • Modeling and dynamics analysis of P2P networks based on evolutionary games

    Creator:
    Cho, Seungyun
    Abstract:
    Since free riders in P2P network reduce the system's performance, how to maintain and encourage the nodes' cooperation is an important aspect of P2P related research. In this thesis, a P2P system is modeled based on two games: stag hunt game and snowdrift game. To relate the model to the...
    Resource Type:
    Masters Thesis
    Full Text:
    evolutionary model for P2P system can be built. Suppose node k(k=i,j, i=1,2,...n, j=1,2,...n, n >2) in the

  • Galileo - a system for analyzing Java bytecode database handlers subsystem

    Creator:
    Balasubramanian, Eswar, Sharma, Hitesh, and Thorat, Aarti
    Abstract:
    Analysis of programs forms an important activity in the field of software engineering. It is necessary to help understand the code, which facilitates comprehensive testing, maintenance and optimization of code. Aristotle is a tool for analyzing programs written in C. We have designed a system on similar lines for Java...
    Resource Type:
    Capstone Project
    Full Text:
    () getbastcblock.S() _ return - -,- I Bk>cklnstr X nstrumenttype = Blo~k j for each block 0

  • Offensive Direction Inference in Real-World Football Video

    Creator:
    Lu, Qingkai
    Abstract:
    Automatic analysis of American football videos can help teams develop strategies and extract patterns with less human effort. In this work, we focus on the problem of automatically determining which team is on offense/defense, which is an important subproblem for higher-level analysis. While seemingly mundane, this problem is quite challenging...
    Resource Type:
    Masters Thesis
    Full Text:
    of of KNN with different K . . . . . . . . . . . . . 32 LIST OF ALGORITHMS Algorithm Page

  • Knowledge Base Completion Leveraging Natural Language Data

    Creator:
    Shahbazi, Hamed
    Abstract:
    Information about named entities (real-world objects) is usually harvested from different sources and organized as a multiple relational directed graph in Knowledge Bases (KBs). KBs play essential roles in many NLP modules including question answering, fact-checking, search engines, etc. KBs are big but still incomplete: relational information among entities is...
    Resource Type:
    Dissertation
    Full Text:
    [27] introduce a soft k-max attention model to weigh the importance of other entities in the document

  • Evaluation functions in aerial image segmentation

    Creator:
    Langford, William T.
    Abstract:
    Remote sensing is the most practical way to acquire large amounts of land cover data for monitoring and understanding environmental change, so it is important to be able to map land cover from imagery. Maps defining land cover patches as polygons rather than pixels greatly improve processing efficiency in models...
    Resource Type:
    Dissertation
    Full Text:
    aligned with the axes. Formally, we define patch compaction as: where PCk k= patch ID pk number of

  • Action Segmentation in Videos: Deep Models, Prediction Diffusion, and Deep-Temporal Augmentations

    Creator:
    Aziere, Nicolas
    Abstract:
    This paper addresses the high model complexity and overconfident frame labeling of state-of-the-art (SOTA) action segmenters. Their complexity is typically justified by the need to sequentially refine action segmentation through multiple stages of a deep architecture. However, this multistage refinement does not take into account uncertainty of frame labeling predicted...
    Resource Type:
    Dissertation
    Full Text:
    robust evaluation process, we adopt the standard practice of K-fold cross-validation. This entails

  • Computational Approaches for RNA Structure Prediction with Dynamic Programming and Deep Neural Networks

    Creator:
    Deng, Dezhong
    Abstract:
    Our goal is to build a system to model the RNA sequences that reveals their structural information by using efficient dynamic programming algorithms and deep learning approaches. We aim to 1) achieve linear-time for RNA secondary structure prediction based on existing minimum free energy models; 2) utilize deep neural networks...
    Resource Type:
    Dissertation
    Full Text:
    . Accuracy from three ways of ensembling top- k models are plotted in different colors, and the accuracy of k

  • Leveraging Structures of the Data in Deep Learning

    Creator:
    Li, Xingyi
    Abstract:
    The performance of deep learning frameworks could be significantly improved through considering the particular underlying structures for each dataset. In this thesis, I summarize our three work about boosting the performance of deep learning models through leveraging structures of the data. In the first work, we theoretically justify that, for...
    Resource Type:
    Dissertation
    Full Text:
    an integer lattice structure, i.e., Xi = {Xi(k),k ∈ Zp} where k is a p-dimensional index vector. Let