Now showing items 1-20 of 166

    • 3D Object Representations for Robot Perception 

      Burchfiel, Benjamin Clark Malloy (2019)
      Reasoning about 3D objects is one of the most critical perception problems robots face; outside of navigation, most interactions between a robot and its environment are object-centric. Object-centric robot perception has ...
    • A Logical Controller Architecture for Network Security 

      Yao, Yuanjun (2020)
      Networked infrastructure-as-a-service testbeds are evolving with higher capacity and more advanced capabilities. Modern testbeds offer stitched virtual circuit capability, programmable dataplanes with software-defined networking ...
    • A Semi-Supervised Predictive Model to Link Regulatory Regions to Their Target Genes 

      Hafez, Dina Mohamed (2015)
      Next generation sequencing technologies have provided us with a wealth of data profiling a diverse range of biological processes. In an effort to better understand the process of gene regulation, two predictive machine learning ...
    • A Theoretical and Experimental Study of DNA Self-assembly 

      Chandran, Harish (2012)
      The control of matter and phenomena at the nanoscale is fast becoming one of the most important challenges of the 21st century with wide-ranging applications from energy and health care to computing and material science. ...
    • Accelerating Data Parallel Applications via Hardware and Software Techniques 

      Bashizade, Ramin (2020)
      The unprecedented amount of data available today opens the door to many new applications in areas such as finance, scientific simulation, machine learning, etc. Many such applications perform the same computations on different ...
    • Adapting a Kidney Exchange Algorithm to Incorporate Human Values 

      Freedman, Rachel (2017-05-04)
      Artificial morality is moral behavior exhibited by automated or artificially intelligent agents. A primary goal of the field of artificial morality is to design artificial agents that act in accordance with human values. ...
    • Algorithms for Allocation Problems in Online Settings 

      Kell, Nathaniel Brian (2018)
      A fundamental computational challenge that arises in the operation of online systems, services, and platforms is that of resource allocation. Broadly defined, a resource allocation problem is one where set of users generate ...
    • Algorithms for Analyzing Spatio-Temporal Data 

      Nath, Abhinandan (2018)
      In today's age, huge data sets are becoming ubiquitous. In addition to their size, most of these data sets are often noisy, have outliers, and are incomplete. Hence, analyzing such data is challenging. We look at applying ...
    • Algorithms for continuous queries: A geometric approach 

      Yu, Albert (2013)
      There has been an unprecedented growth in both the amount of data and the number of users interested in different types of data. Users often want to keep track of the data that match their interests over a period of time. ...
    • Algorithms for Geometric Matching, Clustering, and Covering 

      Pan, Jiangwei (2016)
      With the popularization of GPS-enabled devices such as mobile phones, location data are becoming available at an unprecedented scale. The locations may be collected from many different sources such as vehicles moving around ...
    • Algorithms for Networks With Uncertainty 

      Haney, Samuel Mitchell (2019)
      In this dissertation, we study algorithmic problems motivated by the optimization of networks under uncertainty.We summarize our contributions:\begin{itemize}\item \textbf{Subset $k$-server:} We propose and give algorithms ...
    • Algorithms for Public Decision Making 

      Fain, Brandon Thomas (2019)
      In public decision making, we are confronted with the problem of aggregating the conflicting preferences of many individuals about outcomes that affect the group. Examples of public decision making include allocating shared ...
    • Algorithms for the Reeb Graph and Related Concepts 

      Parsa, Salman (2014)
      This thesis is concerned with a structure called the Reeb graph. There are three main problems considered. The first is devising an efficient algorithm for comnstructing the Reeb graph of a simplicial complex with respect ...
    • Algorithms for Two-sided Online Marketplaces 

      Alijani, Reza (2020)
      The recent emergence of new successful two-sided online platforms has transformed the concept of a marketplace. Numerous two-sided mechanism design problems, including those studied in this thesis, are motivated by these ...
    • All-Near-Neighbor Search Among High-Dimensional Data via Hierarchical Sparse Graph Code Filtering 

      Iliopoulos, Alexandros Stavros (2020)
      This thesis addresses the problem of all-to-all near-neighbor (all-NN) search among a large dataset of discrete points in a high-dimensional feature space endowed with a distance metric. Near-neighbor search is fundamental ...
    • An Exploratory Study of Cell Growth and Division Data 

      Niu, Tong (2016)
      Understanding the mechanism behind cell-size control of bacteria such as E. coli has been an active research topic for decades. Until about 2010, most studies were limited to measurements at the cell population level. Recently ...
    • An Operating System Architecture for Networked Server Infrastructure 

      Irwin, David Emory (2007-12-14)
      Collections of hardware components are the foundation of computation and consist of interconnections of different types of the same core elements: processors, disks, memory cards, I/O devices, and network links. Designing ...
    • Applying Differential Privacy with Sparse Vector Technique 

      Chen, Yan (2018)
      In today's fast-paced developing digital world, a wide range of services such as web services, social networks, and mobile devices collect a large amount of personal data from their users. Although sharing and mining large-scale ...
    • Approximate Inference for High-Dimensional Latent Variable Models 

      Tan, Zilong (2018)
      Latent variable models are widely used in applications ranging fromnatural language processing to recommender systems. Exact inferenceusing maximum likelihood for these models is generally NP-hard, andcomputationally prohibitive ...
    • Approximately Optimal Mechanisms With Correlated Buyer Valuations 

      Albert, Michael Joseph (2013)
      Cremer and McLean 1985 shows that if buyers valuations are suciently correlated, there is a mechanism that allows the seller to extract the full surplus from the buyers. However, in practice, we do not see the Cremer-McLean ...