OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Li, Rui; Tian, Tai-Peng; Sclaroff, Stan (Boston University Computer Science Department, 2007-08)
    The goal of this work is to learn a parsimonious and informative representation for high-dimensional time series. Conceptually, this comprises two distinct yet tightly coupled tasks: learning a low-dimensional manifold and ...
  • Alon, Jonathan; Athitsos, Vassilis; Yuan, Quan; Sclaroff, Stan (Boston University Computer Science Department, 2004-03-08)
    A framework for the simultaneous localization and recognition of dynamic hand gestures is proposed. At the core of this framework is a dynamic space-time warping (DSTW) algorithm, that aligns a pair of query and model ...
  • Sigal, Leonid; Sclaroff, Stan; Athitsos, Vassilis (Boston University Computer Science Department, 2003-03-25)
    A novel approach for real-time skin segmentation in video sequences is described. The approach enables reliable skin segmentation despite wide variation in illumination during tracking. An explicit second order Markov model ...
  • Atlas, Alia; Bestavros, Azer (Boston University Computer Science Department, 1998-05-02)
    In this paper, we present Slack Stealing Job Admission Control (SSJAC)---a methodology for scheduling periodic firm-deadline tasks with variable resource requirements, subject to controllable Quality of Service (QoS) ...
  • Esposito, Flavio; Matta, Ibrahim; Ishakian, Vatche (Computer Science Department, Boston University, 2011-12-13)
    Network virtualization provides a novel approach to run multiple concurrent virtual networks over a common physical network infrastructure. From a research perspective, this enables the networking community to concurrently ...
  • Bera, Debajyoti; Green, Frederic; Homer, Steven (Boston University Computer Science Department, 2007)
    Small depth quantum circuits have proved to be unexpectedly powerful in comparison to their classical counterparts. We survey some of the recent work on this and present some open problems.
  • Jin, Shudong; Bestavros, Azer (Boston University Computer Science Department, 2002-01)
    Recent work has shown the prevalence of small-world phenomena [28] in many networks. Small-world graphs exhibit a high degree of clustering, yet have typically short path lengths between arbitrary vertices. Internet AS-level ...
  • 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 ...

Search OpenBU


Browse

Deposit Materials

Statistics