Search Constraints

Start Over
Filtering by: Alternative title ssim Circular no. 34 Remove constraint Alternative title ssim: Circular no. 34 Degree Field Computer Science Remove constraint Degree Field: Computer Science License All rights reserved Remove constraint License: All rights reserved

Search Results

  • Multimedia streaming using multiple TCP connections

    Creator:
    Tullimalli, Sunand
    Abstract:
    Packet loss, delay and time-varying bandwidth are three main problems facing multimedia streaming applications over the Internet. Existing techniques such as Media-aware network protocol, network adaptive source and channel coding, etc. have been proposed to either overcome or alleviate these drawbacks of the Internet. But these techniques either need specialized...
    Resource Type:
    Masters Thesis
    Full Text:
    implemented at the application layer. Thus no kernel modification is necessary, which ensures easy

  • Efficient Incremental Panorama Reconstruction from Multiple Videos

    Creator:
    Feng, Zhongyuan
    Abstract:
    Constructing a panorama from a set of videos is a long-standing problem in computer vision. A panorama represents an enhanced still-image representation of an entire scene captured in a set of videos, where each video shows only a part of the scene. Importantly, a panorama shows only the scene background,...
    Resource Type:
    Capstone Project
    Full Text:
    with different parts of the panorama stop changing, or when there are no new video frames that would

  • One-to-many node disjoint paths routing in generalized hypercube, dense Gaussian, and hexagonal mesh networks

    Creator:
    Alsaleh, Omar I.
    Abstract:
    Routing from a single source node to multiple destination nodes using node disjoint paths (NDP) has many important applications in parallel systems. For example, if a source node wants to send distinct messages to distinct destination nodes, then the one-to-many NDP routing is useful. Unlike parallel systems with shared-memory, each...
    Resource Type:
    Dissertation
    Full Text:
    , small diameter, and strong fault tolerance to maximize the computing performance [13, 14, 24, 34, 41

  • Improving GPGPU NoC Performance with Memory Controller Placement Awareness

    Creator:
    Kollipara, Lakshman Madhav
    Abstract:
    General-purpose Graphics Processing Units (GPGPUs) have become a critical component in high-performance computing (HPC) systems in executing modern computational workloads. The high thread level parallelism (TLP) and programmable shader cores allow thousands of threads to execute in Parallel. The fast-scaling of GPGPUs have increased the demand for performance optimizations on...
    Resource Type:
    Capstone Project
    Full Text:
    . In case of VC monopolization, if there is no mixed traffic on the link, i.e. each unidirectional

  • Shape Modeling and GPU Based Image Warping

    Creator:
    Burri, David
    Abstract:
    This project addresses the problems of manually placing facial landmarks on a portrait and finding a fast way to warp the annotated image of a face. While there are many approaches to automatically find facial landmarks, most of them provide insufficient results in uncontrolled environments. Thus I introduce a method...
    Resource Type:
    Capstone Project
    Full Text:
    environment). It provides a nice layer of abstraction so that there is no need for the use of low-level

  • Newcomers’ Barriers. . . Is That All? An Analysis of Mentors’ and Newcomers’ Barriers in OSS Projects

    Creator:
    Balali, Sogol
    Abstract:
    Newcomers’ seamless onboarding is important for open collaboration communi- ties, particularly those that leverage outsiders’ contributions to remain sustainable. Nevertheless, previous work shows that OSS newcomers often face several barriers to contribute, which lead them to lose motivation and even give up on contributing. A well-known way to help newcomers...
    Resource Type:
    Masters Thesis
    Full Text:
    that affect mentors; and 34 that affect newcomers (9 af- fect both newcomers and mentors

  • The density signature

    Creator:
    Migler-VonDollen, Theresa
    Abstract:
    In real networks, identifying dense regions is of great importance. For example, in a network that represents academic collaboration, authors within the densest component of the graph tend to be the most prolific. Dense subgraphs often identify communities in social networks. And dense subgraphs can be used to discover regulatory...
    Resource Type:
    Dissertation
    Full Text:
    the case in existing random graph models. No existing random graph model generates graphs that

  • Interactive player tracking for videos in American football

    Creator:
    Bawaskar, Amit
    Abstract:
    This thesis presents an interactive software tool for tracking a moving object in a video. In particular, we focus on the problem of tracking a player in American football videos. Object tracking is one of the fundamental problems in computer vision. It is one of the most important components in...
    Resource Type:
    Masters Thesis
    Full Text:
    football videos, there are no existing trackers which are sufficiently robust to accurately track a

  • Exploratory Study to Uncover Student Mental Models of Singly Linked Lists in the C Programming Language

    Creator:
    Almadhoun, Eman
    Abstract:
    In computer science, learning abstract fundamental programming concepts requiring students to understand memory management can be very difficult and lead to misunderstandings that carry on into advanced topics. This is especially true in data structures with abstract data types. Understanding how novice students think and reason about data structures is...
    Resource Type:
    Dissertation
    Full Text:
    34 4.1 RQ1: What are students’ mental models of linked lists in the C programming language, and how

  • New constructions and applications for homomorphic secret sharing and function secret sharing

    Creator:
    Singh, Jaspal
    Abstract:
    A secret sharing scheme allows a dealer to distribute a secret with a set of parties, such that only a certain subset of parties can collaborate and learn the shared secret. Traditional secret sharing schemes have been used as building blocks in various subdomains of cryptography. Recently, two new extensions...
    Resource Type:
    Dissertation
    Full Text:
    , where one party’s input set has a publicly known structure. Security here implies no party learns