OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Kwon, Gu-In; Byers, John W. (Boston University Computer Science Department, 2002)
    A significant impediment to deployment of multicast services is the daunting technical complexity of developing, testing and validating congestion control protocols fit for wide-area deployment. Protocols such as pgmcc and ...
  • Skowyra, Rick; Bahargam, Sanaz; Bestavros, Azer (Computer Science Department, Boston University, 2013-05-01)
    The increasing deployment of networked mobile embedded devices leads to unique challenges in communications security. This is especially true for embedded biomedical devices and robotic materials handling, in which subversion ...
  • Donnelly, Kevin; Kfoury, Assaf J. (Boston University Computer Science Department, 2005-07-27)
    Weak references are references that do not prevent the object they point to from being garbage collected. Most realistic languages, including Java, SML/NJ, and OCaml to name a few, have some facility for programming with ...
  • Yoon, Jaehee; Bestavros, Azer; Matta, Ibrahim (Boston University Computer Science Department, 1999-12-10)
    SomeCast is a novel paradigm for the reliable multicast of real-time data to a large set of receivers over the Internet. SomeCast is receiver-initiated and thus scalable in the number of receivers, the diverse characteristics ...
  • 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 ...
  • Rosales, Rómer; Sclaroff, Stan (Boston University Computer Science Department, 2003-03-28)
    A probabilistic, nonlinear supervised learning model is proposed: the Specialized Mappings Architecture (SMA). The SMA employs a set of several forward mapping functions that are estimated automatically from training data. ...
  • Rosales-del-Moral, Rómer E. (Boston University Computer Science Department, 2002)
    A fundamental task of vision systems is to infer the state of the world given some form of visual observations. From a computational perspective, this often involves facing an ill-posed problem; e.g., information is lost ...
  • Jin, Shudong; Guo, Liang; Matta, Ibrahim; Bestavros, Azer (Boston University Computer Science Department, 2002-07)
    The increasing diversity of Internet application requirements has spurred recent interest in transport protocols with flexible transmission controls. In window-based congestion control schemes, increase rules determine how ...
  • Jin, Shudong; Guo, Liang; Matta, Ibrahim; Bestavros, Azer (Boston University Computer Science Department, 2001-02-02)
    The increased diversity of Internet application requirements has spurred recent interests in transport protocols with flexible transmission controls. In window-based congestion control schemes, increase rules determine how ...
  • Bestavros, Azer (Boston University Computer Science Department, 1993-01-27)
    In this paper, we propose a new class of Concurrency Control Algorithms that is especially suited for real-time database applications. Our approach relies on the use of (potentially) redundant computations to ensure that ...
  • Atlas, Alia; Bestavros, Azer (Boston University Computer Science Department, 1998-05-02)
    The SRMS Workbench is a software system developed to demonstrate the notion of Statistical QoS employed in SRMS [AtlasBestavros:1998]. The SRMS Workbench includes: (1) the SRMS schedulability analyzer (QoS negotiator), ...
  • Byers, John; Kwon, Gu-In (Boston University Computer Science Department, 2001-09)
    Existing approaches for multirate multicast congestion control are either friendly to TCP only over large time scales or introduce unfortunate side effects, such as significant control traffic, wasted bandwidth, or the ...
  • Atlas, Alia; Bestavros, Azer (Boston University Computer Science Department, 1998-05-02)
    In this paper we present Statistical Rate Monotonic Scheduling (SRMS), a generalization of the classical RMS results of Liu and Layland that allows scheduling periodic tasks with highly variable execution times and statistical ...
  • Kfoury, Assaf J.; Bradley, Adam D.; Bestavros, Azer (Boston University Computer Science Department, 2004-02-13)
    We present a type system, StaXML, which employs the stacked type syntax to represent essential aspects of the potential roles of XML fragments to the structure of complete XML documents. The simplest application of this ...
  • Isidoro, John; Sclaroff, Stan (Boston University Computer Science Department, 2003-07-01)
    A method for reconstruction of 3D polygonal models from multiple views is presented. The method uses sampling techniques to construct a texture-mapped semi-regular polygonal mesh of the object in question. Given a set of ...
  • Isidoro, John; Sclaroff, Stan (Boston University Computer Science Department, 2003-07-18)
    An iterative method for reconstructing a 3D polygonal mesh and color texture map from multiple views of an object is presented. In each iteration, the method first estimates a texture map given the current shape estimate. ...
  • Ishakian, Vatche (Computer Science Department, Boston University, 2013-02-08)
    In hosting environments such as Infrastructure as a Service (IaaS) clouds, desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs), which specify minimal fractions of ...
  • Lakhina, Anukool; Papagiannaki, Konstantina; Crovella, Mark; Diot, Christophe; Koloczyk, Eric D.; Taft, Nina (Boston University Computer Science Department, 2003-11-10)
    Network traffic arises from the superposition of Origin-Destination (OD) flows. Hence, a thorough understanding of OD flows is essential for modeling network traffic, and for addressing a wide variety of problems including ...
  • Shaban, Marwan (Boston University Computer Science Department, 1994-03-22)
    By utilizing structure sharing among its parse trees, a GB parser can increase its efficiency dramatically. Using a GB parser which has as its phrase structure recovery component an implementation of Tomita's algorithm (as ...
  • Aggradi, Gabriele Ferrari; Esposito, Flavio; Matta, Ibrahim (Boston University Computer Science Department, 2008-07-10)
    We consider a Delay Tolerant Network (DTN) whose users (nodes) are connected by an underlying Mobile Ad hoc Network (MANET) substrate. Users can declaratively express high-level policy constraints on how "content" should ...

Search OpenBU


Browse

Deposit Materials

Statistics