URI: http://hdl.handle.net/2144/1317

Recently Added

  • A revolution underground: a history and analysis of the management of archaeological resources at Minute Men National Historical Park, Concord, Massachusetts 1959-2000 

    Mead, Leslie A (Boston University, 2000)
    This report documents and examines the history of archaeological management at Minute Man National Historical Park from 1959 to the present. It presents a description of the over 156 archaeological projects that have taken ...
  • Simultaneous Learning of Non-Linear Manifold and Dynamical Models for High-Dimensional Time Series 

    Li, Rui (Boston University Computer Science Department, 2009-08-10)
    The goal of this work is to learn a parsimonious and informative representation for high-dimensional time series. Conceptually, this comprises two distinct yet tightly coupled tasks: learning a low-dimensional manifold and ...
  • Learning a Family of Detectors 

    Yuan, Quan (Boston University Computer Science Department, 2009-06-30)
    Object detection and recognition are important problems in computer vision. The challenges of these problems come from the presence of noise, background clutter, large within class variations of the object class and limited ...
  • Using Markets and Spam to Combat Malware 

    Zatko, Sarah Lieberman; Van Alstyne, Marshall (Boston University Computer Science Department, 2009-05-11)
    We propose an economic mechanism to reduce the incidence of malware that delivers spam. Earlier research proposed attention markets as a solution for unwanted messages, and showed they could provide more net benefit than ...
  • Client-based Logging: A New Paradigm of Distributed Transaction Management 

    Panagos, Euthimios (Boston University Computer Science Department, 1996-06-13)
    The proliferation of inexpensive workstations and networks has created a new era in distributed computing. At the same time, non-traditional applications such as computer-aided design (CAD), computer-aided software engineering ...
  • Hidden Type Variables and Conditional Extension for More Expressive Generic Programs 

    Hallett, Joseph J. (Boston University Computer Science Department, 2007)
    Generic object-oriented programming languages combine parametric polymorphism and nominal subtype polymorphism, thereby providing better data abstraction, greater code reuse, and fewer run-time errors. However, most generic ...
  • Learning Embeddings for Indexing, Retrieval, and Classification, with Applications to Object and Shape Recognition in Image Databases 

    Athitsos, Vassilis (Boston University Computer Science Department, 2006-06-14)
    Nearest neighbor retrieval is the task of identifying, given a database of objects and a query object, the objects in the database that are the most similar to the query. Retrieving nearest neighbors is a necessary component ...
  • The Sensor Network Workbench: Towards Functional Specification, Verification and Deployment of Constrained Distributed Systems 

    Ocean, Michael James (Boston University Computer Science Department, 2009)
    As the commoditization of sensing, actuation and communication hardware increases, so does the potential for dynamically tasked sense and respond networked systems (i.e., Sensor Networks or SNs) to replace existing disjoint ...
  • Constraint-based Mining of Frequent Arrangements of Temporal Intervals 

    Papapetrou, Panagiotis (Boston University Computer Science Department, 2006-12-30)
    The problem of discovering frequent arrangements of temporal intervals is studied. It is assumed that the database consists of sequences of events, where an event occurs during a time-interval. The goal is to mine temporal ...
  • Forewarding in Mobile Opportunistic Networks 

    Erramilli, Vijay (Boston University Computer Science Department, 2009)
    Recent advances in processor speeds, mobile communications and battery life have enabled computers to evolve from completely wired to completely mobile. In the most extreme case, all nodes are mobile and communication takes ...
  • TCP over CDMA2000 Networks: A Cross-Layer Measurement Study 

    Mattar, Karim Abdel Magid (Boston University Computer Science Department, 2007)
    Modern cellular channels in 3G networks incorporate sophisticated power control and dynamic rate adaptation which can have a significant impact on adaptive transport layer protocols, such as TCP. Though there exists studies ...
  • An Improved Robust Fuzzy Extractor 

    Kanukurth, Bhavana (Boston University Computer Science Department, 2009)
    We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, W' to agree on a secret key R in the presence of an active adversary. Robust fuzzy extractors were ...
  • Specialized Mappings Architecture with Applications to Vision-based Estimation of Articulated Body Pose 

    Rosales-del-Moral, Rómer E. (Boston University Computer Science Department, 2002)
    A fundamental task of vision systems is to infer the state of the world given some form of visual observations. From a computational perspective, this often involves facing an ill-posed problem; e.g., information is lost ...
  • Ergodicity and Mixing Rate of One-Dimensional Cellular Automata 

    Park, Kihong (Boston University Computer Science Department, 1996-07-22)
    One-and two-dimensional cellular automata which are known to be fault-tolerant are very complex. On the other hand, only very simple cellular automata have actually been proven to lack fault-tolerance, i.e., to be mixing. ...
  • Indexing Distances in Large Graphs and Applications in Search Tasks 

    Potamias, Michalis (Boston University Computer Science Department, 2009)
    This thesis elaborates on the problem of preprocessing a large graph so that single-pair shortest-path queries can be answered quickly at runtime. Computing shortest paths is a well studied problem, but exact algorithms ...
  • System F with Constraint Types 

    Donnelly, Kevin (Boston University Computer Science Department, 2007)
    System F is a type system that can be seen as both a proof system for second-order propositional logic and as a polymorphic programming language. In this work we explore several extensions of System F by types which express ...
  • Angels: In-Network Support for Minimum Distribution Time in P2P Overlays 

    Sweha, Raymond (Boston University Computer Science Department, 2009-08-06)
    This thesis proposes the use of in-network caches (which we call Angels) to reduce the Minimum Distribution Time (MDT) of a file from a seeder – a node that possesses the file – to a set of leechers – nodes who are interested ...
  • Overlay Network Creation and Maintenance with Selfish Users 

    Smaragdakis, Georgios (Boston University Computer Science Department, 2008)
    Overlay networks have been used for adding and enhancing functionality to the end-users without requiring modifications in the Internet core mechanisms. Overlay networks have been used for a variety of popular applications ...
  • Service Provisioning in Mobile Networks Through Distributed Coordinated Resource Management 

    Morcos, Hany (Boston University Computer Science Department, 2008)
    The pervasiveness of personal computing platforms offers an unprecedented opportunity to deploy large-scale services that are distributed over wide physical spaces. Two major challenges face the deployment of such services: ...
  • Spatiotemporal Gesture Segmentation 

    Alon, Jonathan (Boston University Computer Science Department, 2006-09-18)
    Spotting patterns of interest in an input signal is a very useful task in many different fields including medicine, bioinformatics, economics, speech recognition and computer vision. Example instances of this problem include ...

View more