Institutional Scholarship Home
→
Haverford College
→
Student Life & Scholarship
→
Senior Theses
→
Computer Science
→
Browsing Computer Science by Issue Date

Browsing Computer Science by Issue Date

Now showing items 1-20 of 162

Efficient Handling of Dependence Analysis for Arrays

Seater, Robert (2001)

In this paper, I discuss what array dependence analysis is, and how we can phrase questions about dependencies as questions about integer feasibility. I present the straight forward approaches to dealing with equalities, ...
Timber Ho! : An Examination of the Properties of Special Balanced Search Trees

Barkan, David (2002)

In Computer Science, we are always looking for ways to do things quickly and efficiently. A computer has the ability to solve problems quickly, but as the size of these problems becomes very large, we run the risk of wasting ...
The Number Field Sieve

Lukac, Martin (2002)

The Number Field Sieve is currently the fastest algorithm for factoring. This paper covers each step of the algorithm explaining in detail the mathematics behind this version of the algorithm. The conjectured time complexity ...
Locality and Parallel Optimizations for Parallel Supercomputing

Harrison, Ian (2003)
Natural Language Processing and Translation using Augmented Transition Networks and Semantic Networks

Ramos, Juan (2003)

The problem of computers understanding and communicating with humans using natural languages such as English is a complicated task with many details to examine and explore. The goal of this project, then, is to examine ...
Bi-level Lossless Compression Techniques

Bejile, Brian (2004)

Image compression algorithms have evolved into some of the most complex structures in computing. Yet at the core of these algorithms are simple techniques that have been long known about data compression. This paper explores ...
Static and dynamic type systems

Rushton, Matthew V. (2004)

This paper demonstrates the advantages and disadvantages of static and dynamic type systems. This is done through careful exposition of various implementations. As a motivating example, a subset of the ML language is used ...
Heuristic Counterpoint

Ambrogi, Timothy (2004)

This paper will introduce and formalize the problem of generating 16th-century Fuxian counterpoint using search algorithms. Several algorithms will be analyzed with respect to the problem domain, and the advantages of ...
Thesis Shmesis: Representing Reduplication with Directed Graphs

Coleman, Jason (2004)

This thesis studies the linguistic phenomena of reduplication. I will address two problems involving reduplication: the generation of reduplicative word forms and the recognition of reduplicative patterns. I will show how ...
Evaluating Inherited Attributes Using Haskell and Lazy Evaluation

Moss, William B. (2005)

Parser generators designed for imperative programming languages (C++, Java, etc), such as YACC and CUPS, inevitably run into difficulty handling inherited attributes. In the past, this difficulty has been handled in one ...
Empirical Study of Graph Properties with Particular Interest Towards Random Graphs

Weinstein, Lee (2005)

This paper is an empirical study mainly of graph properties for various graphs including both deterministic graphs, those with a set structure, and random graphs. The main properties that are analyzed are graph diameter, ...
Natural Language Interaction with Robots

Walker, Alden (2007)

Natural language communication with robots has obvious uses in almost all areas of life. Computer-based natural language interaction is an active area of research in Computational Linguistics and AI. While there have been ...
Concurrency in Multi-Core Processor Design

Clancy, Patrick (2007)

It is possible to extend a microprocessor from a single core to a multiple cores by replicating the single core processor, and interfacing them to main memory bus via a bus arbitrator. With a multi-core processor, the ...
An Explication of "A New Algorithm for Transitive Closures and Computation of Recursion in Relational Databases" by Yangjun Chen

Miller, Anne (2008)

In this paper, we discuss the algorithm for computing the transitive closure of a directed, acyclic graph of bounded degree given in Yangjun Chen’s paper, "A New Algorithm for Transitive Closures and Computation of Recursion ...
Digital Watermarking: An Overview of Watermarking in the Context of Digital Rights Management

Moser, Alexander S. (2008)

In this work we present a basic overview of digital rights management technologies, focusing heavily on a technical understanding of digital watermarking and its applications in copyright protection. We discuss the basic ...
Anonymity on the Web: Understanding the Vulnerabilities of Internet Use

Hilton, Stephanie (2009)
Exploring Augmented Reality

Scheinerman, Matt (2009)

This paper illustrates a general overview of augmented reality, a type of technology that incorporates virtual reality and video images into one image. A subset of computer graphics, augmented reality is becoming more ...
From Tapestry to SVD: A Survey of the Algorithms That Power Recommender Systems

Huttner, Joseph (2009)

This paper is a survey of the algorithms that power recommender systems. To start, the social and monetary relevance of recommender systems is outlined. Then we delve into the specifics of how the first recommender system, ...
Garbage Collection: An Overview of Dynamic Data Management

Picone, Nicholas (2010)
Social Recommender systems: Improving recommendations through personalization

Surti, Tanvi (2011)

The vision for Web 3.0 (popularly referred to as the Semantic Web) is the ability to create meaning out of a deluge of qualitative data. This paper explores a very specific instance of the Semantic Web – Social Recommender ...

Browsing Computer Science by Issue Date

Browsing Computer Science by Issue Date

Search

Browse

All of Institutional Scholarship

This Collection

My Account