OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Chiaraviglio, Luca; Matta, Ibrahim (CS Department, Boston University, 2010-03-31)
    We propose a distributed approach in which an Internet Service Provider (ISP) and a Content Provider (CP) cooperate to minimize total power consumption. Our solution is distributed between the ISP and the CP to limit shared ...
  • Chiaraviglio, Luca; Matta, Ibrahim (Boston University Computer Science Department, 2009-11-24)
    Energy-efficient communication has recently become a key challenge for both researchers and industries. In this paper, we propose a new model in which a Content Provider and an Internet Service Provider cooperate to reduce ...
  • Hamandi, Hani; Itkis, Gene (Boston University Computer Science Department, 2004-04-27)
    Group communication is as an important functionality, which needs to be supported by various communication technologies. Applications of group communication include IP (or application-level) multicast, wireless and/or ...
  • HAIL 
    Magee, John; Betke, Margrit (CS Department, Boston University, 2010-09-06)
    We present a framework to adapt software to the needs of individuals with severe motion disabilities who use mouse substitution interfaces. Typically, users are required to adapt to the interfaces that they wish to use. ...
  • Tian, Tai-Peng; Sclaroff, Stan (Boston University Computer Science Department, 2004-11-04)
    Hand signals are commonly used in applications such as giving instructions to a pilot for airplane take off or direction of a crane operator by a foreman on the ground. A new algorithm for recognizing hand signals from a ...
  • La Cascia, Marco; Isidoro, John; Sclaroff, Stan (Boston University Computer Science Department, 1997-11-24)
    A novel method for 3D head tracking in the presence of large head rotations and facial expression changes is described. Tracking is formulated in terms of color image registration in the texture map of a 3D surface model. ...
  • Hallett, Joseph J. (Boston University Computer Science Department, 2007)
    Generic object-oriented programming languages combine parametric polymorphism and nominal subtype polymorphism, thereby providing better data abstraction, greater code reuse, and fewer run-time errors. However, most generic ...
  • Duarte, Fernando; Mattos, Bernardo; Almeida, Jussara; Almeida, Virgílio (Boston University Computer Science Department, 2008-10-14)
    We present a thorough characterization of the access patterns in blogspace, which comprises a rich interconnected web of blog postings and comments by an increasingly prominent user community that collectively define what ...
  • Veloso, Eveline; Almeida, Virgílio; Meira, Wagner; Bestavros, Azer; Jin, Shudong (Boston University Computer Science Department, 2002-05-10)
    We present what we believe to be the first thorough characterization of live streaming media content delivered over the Internet. Our characterization of over five million requests spanning a 28-day period is done at three ...
  • Guo, Liang; Crovella, Mark; Matta, Ibrahim (Boston University Computer Science Department, 2001)
    Long-range dependence has been observed in many recent Internet traffic measurements. In addition, some recent studies have shown that under certain network conditions, TCP itself can produce traffic that exhibits dependence ...
  • Carter, Robert; Park, Kihong (Boston University Computer Science Department, 1993-11)
    This paper investigates the power of genetic algorithms at solving the MAX-CLIQUE problem. We measure the performance of a standard genetic algorithm on an elementary set of problem instances consisting of embedded cliques ...
  • Gurari, Danna; Wu, Zheng; Isenberg, Brett; Zhang, Chentian; Purwada, Alberto; Wong, Joyce; Betke, Margrit (Computer Science Department, Boston University, 2013-12-23)
    High quality segmentations must be captured consistently for applications such as biomedical image analysis. While human drawn segmentations are often collected because they provide a consistent level of quality, computer ...
  • Barman, Dhiman; Matta, Ibrahim (Boston University Computer Science Department, 2003-05-16)
    The Transmission Control Protocol (TCP) has been the protocol of choice for many Internet applications requiring reliable connections. The design of TCP has been challenged by the extension of connections over wireless ...
  • Shaban, Marwan (Boston University Computer Science Department, 1994-03-22)
    We give a hybrid algorithm for parsing epsilon grammars based on Tomita's non-ϵ-grammar parsing algorithm ([Tom86]) and Nozohoor-Farshi's ϵ-grammar recognition algorithm ([NF91]). The hybrid parser handles the same set of ...
  • Taycher, Leonid; La Cascia, Marco; Sclaroff, Stan (Boston University Computer Science Department, 1997-08-14)
    ImageRover is a search by image content navigation tool for the world wide web. The staggering size of the WWW dictates certain strategies and algorithms for image collection, digestion, indexing, and user interface. This ...
  • Sclaroff, Stan; Taycher, Leonid; La Cascia, Marco (Boston University Computer Science Department, 1997-03-24)
    ImageRover is a search by image content navigation tool for the world wide web. To gather images expediently, the image collection subsystem utilizes a distributed fleet of WWW robots running on different computers. The ...
  • Brogle, Kyle; Cooper, Danny; Goldberg, Sharon; Reyzin, Leonid (Computer Science Department, Boston University, 2013-01-07)
    The RPKI is an infrastructure that will provide digitally signed attestations for the hierarchical allocation and suballocation of IP addresses. Its goal is to improve security of interdomain routing by providing reliable ...
  • Heddaya, Abdelsalam; Sinha, Himanshu (Boston University Computer Science Department, 1993-06-04)
    Coherent shared memory is a convenient, but inefficient, method of inter-process communication for parallel programs. By contrast, message passing can be less convenient, but more efficient. To get the benefits of both ...
  • Laoutaris, Nikolaos; Smaragdakis, Georgios; Bestavros, Azer; Byers, John W. (Boston University Computer Science Department, 2006-07-14)
    In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select ...
  • Kanukurth, Bhavana (Boston University Computer Science Department, 2009)
    We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, W' to agree on a secret key R in the presence of an active adversary. Robust fuzzy extractors were ...

Search OpenBU


Browse

Deposit Materials

Statistics