Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Basis Token Consistency: A Practical Mechanism for Strong Web Cache Consistency
    Bradley, Adam D.; Bestavros, Azer (Boston University Computer Science Department, 2001-10-30)
    With web caching and cache-related services like CDNs and edge services playing an increasingly significant role in the modern internet, the problem of the weak consistency and coherence provisions in current web protocols ...
  • A Bayesian Approach for TCP to Distinguish Congestion from Wireless Losses
    Barman, Dhiman; Matta, Ibrahim (Boston University Computer Science Department, 2003-12-03)
    (This Technical Report revises TR-BUCS-2003-011) The Transmission Control Protocol (TCP) has been the protocol of choice for many Internet applications requiring reliable connections. The design of TCP has been challenged ...
  • Bayesian Packet Loss Detection for TCP
    Fonseca, Nahur; Crovella, Mark (Boston University Computer Science Department, 2004-07-06)
    One of TCP's critical tasks is to determine which packets are lost in the network, as a basis for control actions (flow control and packet retransmission). Modern TCP implementations use two mechanisms: timeout, and fast ...
  • Beta-Reduction As Unification
    Kfoury, A.J. (Boston University Computer Science Department, 1996-07-08)
    We define a unification problem ^UP with the property that, given a pure lambda-term M, we can derive an instance Gamma(M) of ^UP from M such that Gamma(M) has a solution if and only if M is beta-strongly normalizable. ...
  • Blocking Java Applets at the Firewall
    Martin, David M.; Rajagopalan, Sivaramakrishnan; Rubin, Aviel D. (Boston University Computer Science Department, 1996-10-29)
    This paper explores the problem of protecting a site on the Internet against hostile external Java applets while allowing trusted internal applets to run. With careful implementation, a site can be made resistant to current ...
  • Boosting Nearest Neighbor Classifiers for Multiclass Recognition
    Athitsos, Vassilis; Sclaroff, Stan (Boston University Computer Science Department, 2004-02-13)
    This paper introduces an algorithm that uses boosting to learn a distance measure for multiclass k-nearest neighbor classification. Given a family of distance measures as input, AdaBoost is used to learn a weighted distance ...
  • BoostMap: A Method for Efficient Approximate Similarity Rankings
    Athitsos, Vassilis; Alon, Jonathan; Sclaroff, Stan; Kollios, George (Boston University Computer Science Department, 2003-11-24)
    This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, metric or non-metric. Database and query ...
  • Bounds on the Power of Constant-Depth Quantum Circuits
    Fenner, S.; Green, F.; Homer, S.; Zhang, Y. (Boston University Computer Science Department, 2004-01-12)
    We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply ...
  • BRITE: Boston University Representative Internet Topology gEnerator: A Flexible Generator of Internet Topologies
    Medina, Alberto; Matta, Ibrahim; Byers, John (Boston University Computer Science Department, 2000-01-21)
    BRITE is a parametrized topology generation tool, which can be used to flexibly control various parameters (such as connectivity and growth models) and study various properties of generated topologies (such power laws, ...
  • BRITE: Universal Topology Generation from a User's Perspective
    Medina, Alberto; Lakhina, Anukool; Matta, Ibrahim; Byers, John (Boston University Computer Science Department, 2001-04-12)
    Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the large-scale structure of its underlying physical topology, the manner in which it evolves over time, and the way in ...
  • BU Computer Science 1998 Proxy Trace: Release Notes
    Bradley, Adam (Boston University Computer Science Department, 1999-09-07)
    In a recent paper (Changes in Web Client Access Patterns: Characteristics and Caching Implications by Barford, Bestavros, Bradley, and Crovella) we performed a variety of analyses upon user traces collected in the Boston ...
  • Building Responsive Systems from Physically-correct Specifications
    Unknown author (Boston University Computer Science Department, 1993-10)
    Predictability - the ability to foretell that an implementation will not violate a set of specified reliability and timeliness requirements - is a crucial, highly desirable property of responsive embedded systems. This ...
  • BU/NSF Workshop on Internet Measurement, Instrumentation and Characterization
    Govindan, Ramesh; Jamin, Sugih; Zekauskas, Matt; Willinger, Walter; Towsley, Don; Pitkow, Jim; Ammar, Mostafa; Padmanabhan, Venkata; Bharghavan, Vaduvur; Schulzrinne, Henning; Rajagopalan, Bala; Zinky, John (Boston University Computer Science Department, 1999-12-15)
  • Cachability of Web Objects
    Zhang, Xiaohui (Boston University Computer Science Department, 2000-08-08)
    Much work on the performance of Web proxy caching has focused on high-level metrics such as hit rate and byte hit rate, but has ignored all the information related to the cachability of Web objects. Uncachable objects ...
  • Cache-and-Relay Streaming Media Delivery for Asynchronous Clients
    Jin, Shudong; Bestavros, Azer (Boston University Computer Science Department, 2002)
    We consider the problem of delivering popular streaming media to a large number of asynchronous clients. We propose and evaluate a cache-and-relay end-system multicast approach, whereby a client joining a multicast session ...
  • The Cache Inference Problem and its Application to Content and Request Routing
    Laoutaris, Nikolaos; Zervas, Georgios; Bestavros, Azer; Kollios, George (Boston University Computer Science Department, 2006-07-14)
    In many networked applications, independent caching agents cooperate by servicing each other's miss streams, without revealing the operational details of the caching mechanisms they employ. Inference of such details could ...
  • Camera-Based Interfaces and Assistive Software for People with Sever Motion Impairments
    Betke, Margrit (Boston University Computer Science Department, 2008)
    Intelligent assistive technology can greatly improve the daily lives of people with severe paralysis, who have limited communication abilities. People with motion impairments often prefer camera-based communication interfaces, ...
  • Camera Canvas: Image Editor for People with Severe Disabilities
    Kim, Won-Beom; Kwan, Christopher; Fedyuk, Igor; Betke, Margrit (Boston University Computer Science Department, 2008)
    Camera Canvas is an image editing software package for users with severe disabilities that limit their mobility. It is specially designed for Camera Mouse, a camera-based mouse-substitute input system. Users can manipulate ...
  • Changes in Web Client Access Patterns: Characteristics and Caching Implications
    Barford, Paul; Bestavros, Azer; Bradley, Adam; Crovella, Mark (Boston University Computer Science Department, 1998-12-04)
    Understanding the nature of the workloads and system demands created by users of the World Wide Web is crucial to properly designing and provisioning Web services. Previous measurements of Web client workloads have been ...
  • Characteristics of WWW Client-based Traces
    Cunha, Carlos R.; Bestavros, Azer; Crovella, Mark E. (Boston University Computer Science Department, 1995-07-18)
    The explosion of WWW traffic necessitates an accurate picture of WWW use, and in particular requires a good understanding of client requests for WWW documents. To address this need, we have collected traces of actual ...

Search OpenBU


Advanced Search

Browse

Deposit Materials