Share to FacebookShare to TwitterShare by Email

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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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. ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...

View more