OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Sinha, Himanshu Shekhar (Boston University Computer Science Department, 1993-04)
    The proliferation of inexpensive workstations and networks has prompted several researchers to use such distributed systems for parallel computing. Attempts have been made to offer a shared-memory programming model on such ...
  • Marwan, Shaban (Boston University Computer Science Department, 1993-10-26)
    We describe a GB parser implemented along the lines of those written by Fong [4] and Dorr [2]. The phrase structure recovery component is an implementation of Tomita's generalized LR parsing algorithm (described in [10]), ...
  • Lakhina, Anukool; Mark, Crovella; Diot, Christophe (Boston University Computer Science Department, 2005-10-05)
    The increasing practicality of large-scale flow capture makes it possible to conceive of traffic analysis methods that detect and identify a large and diverse set of anomalies. However the challenge of effectively analyzing ...
  • Laoutaris, Nikolaos; Smaragdakis, Georgios; Bestavros, Azer; Ioannis Stavrakakis (Boston University Computer Science Department, 2005-07-07)
    Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the appearance of potential mistreatment problems ...
  • Sclaroff, S.; Pentland, A. (Boston University Computer Science Department, 1995-03)
    Modal matching is a new method for establishing correspondences and computing canonical descriptions. The method is based on the idea of describing objects in terms of generalized symmetries, as defined by each object's ...
  • Reynolds, Mark C. (Boston University Computer Science Department, 2009-12-30)
    The Java programming language has been widely described as secure by design. Nevertheless, a number of serious security vulnerabilities have been discovered in Java, particularly in the Bytecode Verifier, a critical component ...
  • Wang, Jingbin; Gu, Erdan; Betke, Margrit (Boston University Computer Science Department, 2005-02-27)
    A novel method that combines shape-based object recognition and image segmentation is proposed for shape retrieval from images. Given a shape prior represented in a multi-scale curvature form, the proposed method identifies ...
  • Li, Rui; Sclaroff, Stan (Boston University Computer Science Department, 2004-11-02)
    Scene flow methods estimate the three-dimensional motion field for points in the world, using multi-camera video data. Such methods combine multi-view reconstruction with motion estimation approaches. This paper describes ...
  • Li, Rui; Sclaroff, Stan (Boston University Computer Science Department, 2007-06)
    Scene flow methods estimate the three-dimensional motion field for points in the world, using multi-camera video data. Such methods combine multi-view reconstruction with motion estimation. This paper describes an alternative ...
  • Bestavros, Azer; Wang, Biao (Boston University Computer Science Department, 1993-10-27)
    This paper presents an algorithm which extends the relatively new notion of speculative concurrency control by delaying the commitment of transactions, thus allowing other conflicting transactions to continue execution and ...
  • Atlas, Alia; Bestavros, Azer (Boston University Computer Science Department, 1998-05-02)
    Quality of Service (QoS) guarantees are required by an increasing number of applications to ensure a minimal level of fidelity in the delivery of application data units through the network. Application-level QoS does not ...
  • Yuan, Quan; Thangali, Ashwin; Ablavsky, Vitaly; Sclaroff, Stan (Boston University Computer Science Department, 2008-06)
    Object detection is challenging when the object class exhibits large within-class variations. In this work, we show that foreground-background classification (detection) and within-class classification of the foreground ...
  • Gorman, Mikhail; Betke, Margrit; Saltzman, Elliot; Lahav, Amir (Boston University Computer Science Department, 2005-12-08)
    The therapeutic effects of playing music are being recognized increasingly in the field of rehabilitation medicine. People with physical disabilities, however, often do not have the motor dexterity needed to play an ...
  • Potamias, Michalis; Bonchi, Francesco; Gionis, Aristides; Kollios, George (Boston University Computer Science Department, 2009-07-14)
    Large probabilistic graphs arise in various domains spanning from social networks to biological and communication networks. An important query in these graphs is the k nearest-neighbor query, which involves finding and ...
  • Londono, Jorge; Bestavros, Azer (Boston University Computer Science Department, 2006-12-15)
    Emerging configurable infrastructures such as large-scale overlays and grids, distributed testbeds, and sensor networks comprise diverse sets of available computing resources (e.g., CPU and OS capabilities and memory ...
  • Crovella, Mark; Barford, Paul (Boston University Computer Science Department, 1997-07-10)
    Prefetching has been shown to be an effective technique for reducing user perceived latency in distributed systems. In this paper we show that even when prefetching adds no extra traffic to the network, it can have serious ...
  • Day, John; Matta, Ibrahim; Mattar, Karim (Boston University Computer Science Department, 2008-08-15)
    This position paper outlines a new network architecture, i.e., a style of construction that identifies the objects and how they relate. We do not specify particular protocol implementations or specific interfaces and ...
  • Bera, Debajyoti (Boston University Computer Science Department, 2008-07-22)
    We present a technique to derive depth lower bounds for quantum circuits. The technique is based on the observation that in circuits without ancillae, only a few input states can set all the control qubits of a Toffoli ...
  • Kfoury, A.J.; Wells, J.B. (Boston University Computer Science Department, 1994-12-19)
    Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether a λ-term is beta-strongly normalizing is reduced to the question of whether a λ-term is merely normalizing under one of ...
  • Gacs, Peter (Boston University Computer Science Department, 1995-03-27)
    There are several proofs now for the stability of Toom's example of a two-dimensional stable cellular automaton and its application to fault-tolerant computation. Simon and Berman simplified and strengthened Toom's original ...

Search OpenBU


Browse

Deposit Materials

Statistics