Now showing items 21-40 of 47

    • Functionally homogeneous clustering: a framework for building scalable data-intensive internet services 

      Saito, Yasushi, 1967- (2001)
      This dissertation proposes functionally homogeneous clustering (FHC), a new software architecture for building data-intensive Internet services that are manageable, available, fast, and inexpensive. FHC lets any node in ...
    • Group testing for image compression 

      Hong, Edwin S (2001)
      This thesis studies the application of group testing to image compression. Group testing is a technique used for identifying a few significant items out of a large set. Image compression studies techniques for making image ...
    • Improving effectiveness of automated software testing in the absence of specifications 

      Xie, Tao, 1975- (2005)
      This dissertation presents techniques for improving effectiveness of automated software testing in the absence of specifications, evaluates the efficacy of these techniques, and proposes directions for future research.Software ...
    • Interactive character animation using dynamic elastic simulation 

      Capell, Steve (2004)
      This dissertation describes a framework for interactively animating characters such as humans and animals based on dynamic elastic simulation. Using dynamic simulation, the secondary motion of the character's soft tissue ...
    • A kernel for distributed and shared memory communication 

      Rao, Ram C (1982)
      Interprocess communication via shared memory has received considerable attention in the past. More recently, there has been a growing interest in communication in distribution environments. This dissertation examines ...
    • Lightweight structural summarization as an aid to software evolution 

      Murphy, Gail C. (Gail Cecile), 1965- (1996)
      To effectively perform a change to an existing software system, a software engineer needs to have some understanding of the structure of the system. All too often, though, an engineer must proceed to change a system without ...
    • Locati[o]n-based activity recognition 

      Liao, Lin (2006)
      Automatic recognition of human activities can support many applications, from context aware computing to just-in-time information systems to assistive technology for the disabled. Knowledge of a person's location provides ...
    • Machine learning as massive search 

      Segal, Richard B (1997)
      Machine learning is the inference of general patterns from data. Machine-learning algorithms search large spaces of potential hypotheses for the hypothesis that best fits the data. Since the search space for most induction ...
    • Motif-based mining of protein sequences 

      Liu, Agatha H (2002)
      We introduce CASTOR, an automatic, unsupervised system for protein motif discovery and classification. Given amino acid sequences for a group of proteins, CASTOR generates statistically significant motifs and constructs a ...
    • On profit maximization in mechanism design 

      Cary, Matthew, 1974- (2007)
      Mechanism design is a subfield of game theory and microeconomics focused on incentive engineering. A mechanism is a protocol, typically taking the form of an auction, that is explicitly designed so that rational but ...
    • On the use and performance of communication primitives in software controlled cache-coherent cluster architectures 

      Qin, Xiaohan, 1964- (1997)
      Two recent trends are affecting the design of medium-scale shared-memory multi-processors. The first is the use of nodes which themselves consist of clusters of processors. Clusters, already available as commodity parts, ...
    • Parallel prefetching and caching 

      Kimbrel, Tracy (1997)
      High-performance I/O systems depend on prefetching and caching to deliver good performance to applications. These two techniques have generally been considered in isolation, even though there are significant interactions ...
    • Programming by demonstration: a machine learning approach 

      Lau, Tessa (2001)
      Programming by demonstration (PBD) enables users to construct programs to automate repetitive tasks without writing a line of code. The key idea in PBD is to generalize from the user's demonstration of the program on a ...
    • Representation of d-dimensional geometric objects 

      Brisson, Erik, 1957- (1990)
      This work investigates data structures and algorithms for representing and manipulating d-dimensional geometric objects for arbitrary d $\le$ 1. These objects are often described by a set of basic building blocks, together ...
    • Role oriented programming for software evolution 

      VanHilst, Michael, 1953- (1997)
      This thesis addresses the problem of changing requirements in software evolution. It presents a method of development and change based on roles, where a role, in object oriented development, is a part of an object that ...
    • Scheduling protocols for media-on-demand systems 

      VanDeGrift, Tammy (2005)
      Today's abundance of personal electronic devices and the growth of communications networks gives rise to a new set of applications. One such application allows clients to access high-bandwidth streaming media at times of ...
    • Search algorithms for biosequences using random projection 

      Buhler, Jeremy (2001)
      The recent explosion in the availability of long contiguous genomic sequences, including the complete genomes of several organisms, poses substantial challenges for bioinformatics. In particular, algorithms must be developed ...
    • Seeing structure: using knowledge to reconstruct and illustrate anatomy 

      Hinshaw, Kevin P (2000)
      Current medical imaging technology makes it possible to gather remarkably detailed three-dimensional data about an individual's anatomy. In domains ranging from education to clinical medicine, a common desire is the ability ...
    • Simultaneous multithreading 

      Tullsen, Dean Michael (1996)
      This dissertation examines simultaneous multithreading, a technique permitting several independent threads to issue instructions to a superscalar processor's functional units in a single cycle. Simultaneous multithreading ...
    • Some computational problems from genomic mapping 

      Mumey, Brendan Marshall, 1968- (1997)
      Modern molecular biology has presented computer science a host of interesting theoretical problems to work on. This thesis presents new algorithms for two computational problems from genomic mapping: The first problem ...