OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • 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 ...
  • Gabay, Yarom; Ocean, Michael J.; Kfoury, Assaf J.; Liu, Likai (Boston University Computer Science Department, 2006-02-06)
    Sensor applications in Sensoria [1] are expressed using STEP (Sensorium Task Execution Plan). SNAFU (Sensor-Net Applications as Functional Units) serves as a high-level sensor-programming language, which is compiled into ...
  • Rodeski, Vladimir; Mullally, William; Bellardine, Carissa; Lutchen, Kenneth; Betke, Margrit (Boston University Computer Science Department, 2005-07-07)
    A difficulty in lung image registration is accounting for changes in the size of the lungs due to inspiration. We propose two methods for computing a uniform scale parameter for use in lung image registration that account ...
  • Nagy, Sue; Bestavros, Azer (Boston University Computer Science Department, 1997-05-15)
    We propose and evaluate admission control mechanisms for ACCORD, an Admission Control and Capacity Overload management Real-time Database framework-an architecture and a transaction model-for hard deadline RTDB systems. ...
  • Crovella, Mark E.; Frangioso, Robert; Harchol-Balter, Mor (Boston University Computer Science Department, 1999-03-31)
    Under high loads, a Web server may be servicing many hundreds of connections concurrently. In traditional Web servers, the question of the order in which concurrent connections are serviced has been left to the operating ...
  • 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 ...

Search OpenBU


Browse

Deposit Materials

Statistics