OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Bestavros, Azer (Boston University Computer Science Department, 1995-02-07)
    We analyzed the logs of our departmental HTTP server http://cs-www.bu.edu as well as the logs of the more popular Rolling Stones HTTP server http://www.stones.com. These servers have very different purposes; the former ...
  • Kfoury, Assaf (Computer Science Department, Boston University, 2011-07-11)
    Flow networks are inductively defined, assembled from small network modules to produce arbitrarily large ones, with interchangeable and expanding functionally-equivalent parts. We carry out this induction formally using a ...
  • Gursun, Gonca; Crovella, Mark; Matta, Ibrahim (CS Department, Boston University, 2010-11-10)
    Computer systems are increasingly driven by workloads that reflect large-scale social behavior, such as rapid changes in the popularity of media items like videos. Capacity planners and system designers must plan for rapid, ...
  • Atlas, Alia; Bestavros, Azer (Boston University Computer Science Department, 1998-09-02)
    Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and statistical QoS requirements. The main ...
  • Athitsos, Vassilis; Wang, Jingbin; Sclaroff, Stan; Betke, Margrit (Boston University Computer Science Department, 2005-06-13)
    This paper proposes a method for detecting shapes of variable structure in images with clutter. The term "variable structure" means that some shape parts can be repeated an arbitrary number of times, some parts can be ...
  • Fenner, Stephen; Green, Frederic; Homer, Steven (Boston University Computer Science Department, 1998-04-02)
    It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether ...
  • Fenner, Stephen; Green, Frederic; Homer, Steven; Pruim, Randall (Boston University Computer Science Department, 2000-01-20)
    It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether ...
  • Cunha, Carlos R.; Jaccoud, Carlos F.B. (Boston University Computer Science Department, 1997-03-26)
    World-Wide Web (WWW) services have grown to levels where significant delays are expected to happen. Techniques like pre-fetching are likely to help users to personalize their needs, reducing their waiting times. However, ...
  • Gacs, Peter (Boston University Computer Science Department, 1995-11-18)
    Consider a network of processors (sites) in which each site x has a finite set N(x) of neighbors. There is a transition function f that for each site x computes the next state ξ(x) from the states in N(x). But these ...
  • Morcos, Hany; Bestavros, Azer; Matta, Ibrahim (Boston University Computer Science Department, 2008-02-10)
    Commonly, research work in routing for delay tolerant networks (DTN) assumes that node encounters are predestined, in the sense that they are the result of unknown, exogenous processes that control the mobility of these ...
  • Lakhina, Anukool; Crovella, Mark; Diot, Christophe (Boston University Computer Science Department, 2004-02-24)
    Anomalies are unusual and significant changes in a network's traffic levels, which can often involve multiple links. Diagnosing anomalies is critical for both network operators and end users. It is a difficult problem ...
  • Kfoury, Assaf; Mizraei, Saber (Computer Science Department, Boston University, 2012-12-10)
    We review elements of a typing theory for flow networks, which we expounded in an earlier report (BUCS TR 2018). To illustrate the way in which this typing theory offers an alternative framework for the design and analysis ...
  • Guo, Liang; Matta, Ibrahim (Boston University Computer Science Department, 2002)
    Internet measurements show that the size distribution of Web-based transactions is usually very skewed; a few large requests constitute most of the total traffic. Motivated by the advantages of scheduling algorithms which ...
  • Matta, Ibrahim; Guo, Liang (Boston University Computer Science Department, 2000-05-17)
    The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has recently spurred further investigations into its congestion ...
  • Riga, Niky; Matta, Ibrahim; Bestavros, Azer (Boston University Computer Science Department, 2004-05-31)
    Wireless sensor networks have recently emerged as enablers of important applications such as environmental, chemical and nuclear sensing systems. Such applications have sophisticated spatial-temporal semantics that set ...
  • Kfoury, A. J.; Wells, J. B. (Boston University Department of Computer Science, 1993-12-01)
    We study the problem of type inference for a family of polymorphic type disciplines containing the power of Core-ML. This family comprises all levels of the stratification of the second-order lambda-calculus by "rank" of ...
  • Alon, Jonathan; Sclaroff, Stan; Kollios, George; Pavlovic, Vladimir (Boston University Computer Science Department, 2003-03-26)
    A new approach is proposed for clustering time-series data. The approach can be used to discover groupings of similar object motions that were observed in a video collection. A finite mixture of hidden Markov models (HMMs) ...
  • Papapetrou, Panagiotis; Benson, Gary; Kollios, George (Boston University Computer Science Department, 2006-10-15)
    The problem of discovering frequent arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence is studied, and two efficient approaches are proposed to solve it. The first approach ...
  • Bestavros, Azer (Boston University Computer Science Department, 1997-09-10)
    In this paper, we introduce the notion of a "document cluster" in WWW space as a generalization of the notion of a "cache line" in linear memory address space. Through the analysis of Web server logs, we show evidence of ...
  • Bestavros, Azer; Crovella, Mark; Liu, Jun; Martin, David (Boston University Computer Science Department, 1998-02-01)
    To construct high performance Web servers, system builders are increasingly turning to distributed designs. An important challenge that arises in distributed Web servers is the need to direct incoming connections to ...

Search OpenBU


Browse

Deposit Materials

Statistics