OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Ocean, Michael James (Boston University Computer Science Department, 2009)
    As the commoditization of sensing, actuation and communication hardware increases, so does the potential for dynamically tasked sense and respond networked systems (i.e., Sensor Networks or SNs) to replace existing disjoint ...
  • Smaragdakis, Georgios; Matta, Ibrahim; Bestavros, Azer (Boston University Computer Science Department, 2004-05-31)
    We study the impact of heterogeneity of nodes, in terms of their energy, in wireless sensor networks that are hierarchically clustered. In these networks some of the nodes become cluster heads, aggregate the data of their ...
  • Morcos, Hany (Boston University Computer Science Department, 2008)
    The pervasiveness of personal computing platforms offers an unprecedented opportunity to deploy large-scale services that are distributed over wide physical spaces. Two major challenges face the deployment of such services: ...
  • Fortnow, Lance; Homer, Steve (Boston University Computer Science Department, 2003-10-02)
  • Byers, John; Considine, Jeffrey; Mitzenmacher, Michael (Boston University Computer Science Department, 2002)
    Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current schemes based upon consistent hashing require both considerable implementation complexity and ...
  • Bestavros, Azer; Liu, Yueh-Lin (Boston University Computer Science Department, 1995-06-06)
    We describe our extention of the existing DLX simulator (DLXsim), available from the University of California at Berkeley, which allows the simulation of two hardware dynamic scheduling techniques. There are two DLXsim-like ...
  • Li, Rui (Boston University Computer Science Department, 2009-08-10)
    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 ...
  • 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) ...
  • 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 ...
  • 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, 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 ...

Search OpenBU


Browse

Deposit Materials

Statistics