Browsing Computer Science Theses and Dissertations by Title

Navigation

Display Options

Results

  • Belcher, Kristi (University of Oregon, 2020-09-24)
    Particle advection is a fundamental operation for a wide range of flow visualization algorithms. Particle advection execution times can vary based on many factors, including the number of particles, duration of advection, ...
  • Shvedov, Konstantin (University of Oregon, 2022-10-04)
    Developments in neural networks have led to advanced models requiring large amounts of training time and resources. To reduce the environmental impact and to decrease the training times of models, acceleration techniques ...
  • Gravelle, Brian (University of Oregon, 2022-10-04)
    In this dissertation, we demonstrate that it is possible to develop methods of empirical hardware-counter-based performance analysis for scientific applications running on diverse CPUs. Although counters have been used in ...
  • Bleile, Ryan (University of Oregon, 2021-04-29)
    Since near the very beginning of electronic computing, Monte Carlo particle transport has been a fundamental approach for solving computational physics problems. Due to the high computational demands and inherently parallel ...
  • Ehrenkranz, Toby (University of Oregon, 2012)
    The Internet has become an indispensable resource for today's society. It is at the center of the today's business, entertainment, and social world. However, the core of our identities on the Internet, the IP addresses ...
  • Hanson-Smith, Victor, 1981- (University of Oregon, 2011-12)
    The evolutionary history of protein families can be difficult to study because necessary ancestral molecules are often unavailable for direct observation. As an alternative, the field of computational phylogenetics has ...
  • Sane, Sudhanshu (University of Oregon, 2020-09-24)
    Exploratory visualization and analysis of time-dependent vector fields or flow fields generated by scientific simulations is increasingly challenging on modern supercomputers. One possible solution is the use of a ...
  • Wang, Haoran (University of Oregon, 2021-09-13)
    Information Extraction (IE) is one of the most important fields in Natural Language Processing (NLP). The goal for IE tasks is to extract structured knowledge from unstructured text. While most datasets focus on sentence-level ...
  • Binyahib, Roba (University of Oregon, 2020-09-24)
    We consider the problem of efficient particle advection in a distributed- memory parallel setting, focusing on four popular parallelization algorithms. The performance of each of these algorithms varies based on the desired ...
  • Tian, Ran (University of Oregon, 2015-08-18)
    A significant fraction of today's Internet traffic is associated with popular web sites such as YouTube, Netflix or Facebook. In recent years, major Internet websites have become more complex as they incorporate a larger ...
  • Kelly, Austen (University of Oregon, 2020-02-27)
    Machine learning methods often face a tradeoff between the accuracy of discriminative models and the lower sample complexity of their generative counterparts. This inspires a need for hybrid methods. In this paper we present ...
  • Bergstrom, Trevor (University of Oregon, 2020-12-08)
    Human-object interaction detection is a relatively new task in the world of computer vision and visual semantic information extraction. The goal of human-object interaction detection is to have machines identifying ...
  • Hasan, Rasti (University of Oregon, 2022-10-04)
    In recent years, NLP classification tasks have been reformulated as text generation tasks in the form of text-to-text transformer-based models that achieve state-of-the-art performance by better utilizing pre-trained ...
  • Keith, Daniel (University of Oregon, 2012)
    Dynamic invariant detection is a software analysis technique that uses traces of function entry and exit from executing programs and infers partial specifications that characterize the observed behavior. The specifications ...
  • Ludwig, Jeremy R. (University of Oregon, 2008-12)
    The dynamic scripting reinforcement learning algorithm can be extended to improve the speed, effectiveness, and accessibility of learning in modern computer games without sacrificing computational efficiency. This dissertation ...
  • Feng, Yebo (University of Oregon, 2024-01-09)
    The rapid evolution of malicious activities in network environments necessitates the development of more effective and efficient detection and mitigation techniques. Traditional traffic analysis (TA) approaches have ...
  • Kirkpatrick, Arthur Edward (University of Oregon, 2000)
    Haptic environments are user interfaces incorporating a haptic display device, most commonly a point force device such as the PHANToM. Lederman and Klatzky's Exploratory Procedures work casts doubt on the usability of such ...
  • Wathugala, Wathugala Gamage Dulan Manujinda (University of Oregon, 2017-06)
    Ensuring algorithms work accurately is crucial, especially when they drive safety critical systems like self-driving cars. We formally model a published distributed algorithm for autonomous vehicles to collaborate and ...
  • Dinh, Tien (University of Oregon, 2024-01-09)
    Low Earth Orbit (LEO) satellite networks have gained significant attention in recent years due to their potential to revolutionize global connectivity. SpaceX, Amazon, and Telesat are the most prominent players aiming to ...
  • Chaimov, Nicholas (University of Oregon, 2012)
    Efficient large-scale scientific computing requires efficient code, yet optimizing code to render it efficient simultaneously renders the code less readable, less maintainable, less portable, and requires detailed knowledge ...

Search Scholars' Bank


Advanced Search

Browse

My Account

Statistics