OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Kwan, Christopher; Betke, Margrit (Computer Science Department, Boston University, 2011-03-02)
    We developed Camera Canvas, photo editing and picture drawing software for individuals who cannot use their hands to operate a computer mouse. Camera Canvas is designed for use with camera-based mouse-replacement interfaces ...
  • 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 ...
  • 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, ...
  • 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 ...
  • 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 ...
  • Kfoury, A.J.; Wymann-Böni, M. (Boston University Computer Science Department, 1993-08)
    We give an explicit and easy-to-verify characterization for subsets in finite total orders (infinitely many of them in general) to be uniformly definable by a first-order formula. From this characterization we derive ...
  • Lakhina, Anukool; Crovella, Mark; Diot, Christophe (Boston University Computer Science Department, 2004-05-19)
    Detecting and understanding anomalies in IP networks is an open and ill-defined problem. Toward this end, we have recently proposed the subspace method for anomaly diagnosis. In this paper we present the first large-scale ...
  • Almeida, Virgílio; Bestavros, Azer; Crovella, Mark; de Oliveira, Adriana (Boston University Computer Science Department, 1996-06-21)
    As the World Wide Web (Web) is increasingly adopted as the infrastructure for large-scale distributed information systems, issues of performance modeling become ever more critical. In particular, locality of reference is ...
  • 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 ...
  • Albanese, Francesco; Carra, Damiano; Michiardi, Pietro; Bestavros, Azer (CS Department, Boston University, 2010-08-12)
    To leverage the elastic nature of cloud computing, a solution provider must be able to accurately gauge demand for its offering. For applications that involve swarm-to-cloud interactions, gauging such demand is not ...
  • Considine, Jeffrey (Boston University Computer Science Department, 2002-09-01)
    We consider the problem of performing topological optimizations of distributed hash tables. Such hash tables include Chord and Tapestry and are a popular building block for distributed applications. Optimizing topologies ...
  • Londoño, Jorge; Bestavros, Azer; Teng, Shang-Hua (Boston University Computer Science Department, 2009-02-07)
    We introduce Collocation Games as the basis of a general framework for modeling, analyzing, and facilitating the interactions between the various stakeholders in distributed systems in general, and in cloud computing ...
  • Ishakian, Vatche; Sweha, Raymond; Londono, Jorge; Bestavros, Azer (CS Department, Boston University, 2010-03-01)
    By colocating with other tenants of an Infrastructure as a Service (IaaS) offering, IaaS users could reap significant cost savings by judiciously sharing their use of the fixed-size instances offered by IaaS providers. ...
  • Liu, Lifeng; Sclaroff, Stan (Boston University Computer Science Department, 1997-11-24)
    A new deformable shape-based method for color region segmentation is described. The method includes two stages: over-segmentation using a traditional color region segmentation algorithm, followed by deformable model-based ...
  • Sethi, Saratendu; Sclaroff, Stan (Boston University Computer Science Department, 1999-07-27)
    We propose to investigate a model-based technique for encoding non-rigid object classes in terms of object prototypes. Objects from the same class can be parameterized by identifying shape and appearance invariants of the ...
  • La Casica, Marco; Sethi, Sarathendu; Sclaroff, Stan (Boston University Computer Science Department, 1998-02-09)
    Some WWW image engines allow the user to form a query in terms of text keywords. To build the image index, keywords are extracted heuristically from HTML documents containing each image, and/or from the image URL and file ...
  • Fahmy, Amr; Heddaya, Abdelsalam (Boston University Computer Science Department, 1996-09-20)
    Communication and synchronization stand as the dual bottlenecks in the performance of parallel systems, and especially those that attempt to alleviate the programming burden by incurring overhead in these two domains. We ...
  • West, Richard; Fry, Gerald; Wong, Gary (Boston University Computer Science Department, 2005-02-23)
    Research on the construction of logical overlay networks has gained significance in recent times. This is partly due to work on peer-to-peer (P2P) systems for locating and retrieving distributed data objects, and also ...
  • Lapets, Andrei (CS Department, Boston University, 2010-03-15)
    A problem is in the class NP when it is possible to compute in polynomial time that a given solution corresponds to a given problem instance. Those problems for which it is possible to compute in polynomial time a solution ...
  • Donnelly, Kevin; Kfoury, Assaf; Lapets, Andrei (CS Department, Boston University, 2010-03-15)
    Interdomain routing on the Internet is performed using route preference policies specified independently and arbitrarily by each autonomous system (AS) in the network. These policies are used in the border gateway protocol ...

Search OpenBU


Browse

Deposit Materials

Statistics