OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Mullally, William; Sclaroff, Stan; Betke, Margrit (Boston University Computer Science Department, 2009-03-11)
    We propose a novel image registration framework which uses classifiers trained from examples of aligned images to achieve registration. Our approach is designed to register images of medical data where the physical condition ...
  • Liu, Likai; Kfoury, Assaf (Boston University Computer Science Department, 2008-01-24)
    In our previous work, we developed TRAFFIC(X), a specification language for modeling bi-directional network flows featuring a type system with constrained polymorphism. In this paper, we present two ways to customize the ...
  • Guirguis, Mina; Bestavros, Azer; Matta, Ibrahim (Boston University Computer Science Department, 2003-12-02)
    For a given TCP flow, exogenous losses are those occurring on links other than the flow's bottleneck link. Exogenous losses are typically viewed as introducing undesirable "noise" into TCP's feedback control loop, leading ...
  • Crovella, Mark E.; Bestavros, Azer (Boston University Computer Science Department, 1995-10-12)
    Recently the notion of self-similarity has been shown to apply to wide-area and local-area network traffic. In this paper we examine the mechanisms that give rise to self-similar network traffic. We present an explanation ...
  • Bestavros, Azer; Kim, Gitae (Boston University Computer Science Department, 1997-01-24)
    While ATM bandwidth-reservation techniques are able to offer the guarantees necessary for the delivery of real-time streams in many applications (e.g. live audio and video), they suffer from many disadvantages that make ...
  • Guiguis, Mina; Bestavros, Azer; Matta, Ibrahim (Boston University Computer Science Department, 2004-01-30)
    In this paper, we expose an unorthodox adversarial attack that exploits the transients of a system's adaptive behavior, as opposed to its limited steady-state capacity. We show that a well orchestrated attack could introduce ...
  • Londono, Jorge; Manjanatha; Han, Zhinan Jenny (Boston University Computer Science Department, 2006-07-14)
    The SNBENCH is a general-purpose programming environment and run-time system targeted towards a variety of Sensor applications such as environmental sensing, location sensing, video sensing, etc. In its current structure, ...
  • Chang, Ching; Sweha, Raymond; Papapetrou (Boston University Computer Science Department, 2006-07-14)
    The purpose of this project is the creation of a graphical "programming" interface for a sensor network tasking language called STEP. The graphical interface allows the user to specify a program execution graphically from ...
  • Burke, Dustin; Cecere, Dave; Ben Freiberg (Boston University Computer Science Department, 2006-12-16)
    In this project we design and implement a centralized hashing table in the snBench sensor network environment. We discuss the feasibility of this approach and compare and contrast with the distributed hashing architecture, ...
  • Parmer, Gabriel; Zervas, Georgios; Bagchi, Angshuman (Boston University Computer Science Department, 2006-07-14)
    It is useful in systems that must support multiple applications with various temporal requirements to allow application-specific policies to manage resources accordingly. However, there is a tension between this goal and ...
  • Vasconcelos, Marisa; Crovella, Mark (Boston University Computer Science Department, 2008-09-11)
    Localization is essential feature for many mobile wireless applications. Data collected from applications such as environmental monitoring, package tracking or position tracking has no meaning without knowing the location ...
  • Buzan, Dan; Sclaroff, Stan; Kollios, George (Boston University Computer Science Department, 2004-04-23)
    A system is described that tracks moving objects in a video dataset so as to extract a representation of the objects' 3D trajectories. The system then finds hierarchical clusters of similar trajectories in the video dataset. ...
  • Yuan, Quan; Thangali, Ashwin; Sclaroff, Stan (Boston University Computer Science Department, 2005-06-10)
    Nearest neighbor search is commonly employed in face recognition but it does not scale well to large dataset sizes. A strategy to combine rejection classifiers into a cascade for face identification is proposed in this ...
  • Castelli, Thomas J.; Betke, Margrit; Neidle, Carol (Boston University Computer Science Department, 2005-07-07)
    Facial features play an important role in expressing grammatical information in signed languages, including American Sign Language(ASL). Gestures such as raising or furrowing the eyebrows are key indicators of constructions ...
  • Amtoft, Torben; Turbak, Franklyn (Boston University Computer Science Department, 2000-01-10)
    Recent work has shown equivalences between various type systems and flow logics. Ideally, the translations upon which such equivalences are based should be faithful in the sense that information is not lost in round-trip ...
  • Byers, John; Considine, Jeffrey; Mitzenmacher, Michael (Boston University Computer Science Department, 2002)
    We present new, simple, efficient data structures for approximate reconciliation of set differences, a useful standalone primitive for peer-to-peer networks and a natural subroutine in methods for exact reconciliation. In ...
  • Tian, Tai-Peng; Sclaroff, Stan (CS Department, Boston University, 2010-03-31)
    This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time complexity scales exponentially in the size of ...
  • Waber, Benjamin N.; Magee, John J.; Betke, Margrit (Boston University Computer Science Department, 2005-07-07)
    Accurate head tilt detection has a large potential to aid people with disabilities in the use of human-computer interfaces and provide universal access to communication software. We show how it can be utilized to tab through ...
  • Potamias, Michalis; Castillo, Carlos; Francesco, Bonchi; Gionis, Aristides (Boston University Computer Science Department, 2009-03-09)
    We study the problem of preprocessing a large graph so that point-to-point shortest-path queries can be answered very fast. Computing shortest paths is a well studied problem, but exact algorithms do not scale to huge ...
  • La Casica, Marco; Sclaroff, Stan (Boston University Computer Science Department, 1998-12-04)
    An improved technique for 3D head tracking under varying illumination conditions is proposed. The head is modeled as a texture mapped cylinder. Tracking is formulated as an image registration problem in the cylinder's ...

Search OpenBU


Browse

Deposit Materials

Statistics