Browsing Computer Science by Issue Date

OpenBU

Browsing Computer Science by Issue Date

Sort by: Order: Results:

  • 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 ...
  • 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 ...
  • Kfoury, A.J.; Wells, J.B. (Boston University Computer Science Department, 1995-03-31)
    This is an addendum to our technical report BUCS TR-94-014 of December 19, 1994. It clarifies some statements, adds information on some related research, includes a comparison with research be de Groote, and fixes two ...
  • Bestavros, Azer; Cunha, Carlos (Boston University Computer Science Department, 1995-04-28)
    The growing traffic of WWW related services requires the development of efficient protocols for reducing traffic, balancing load, and improving service time. One way of achieving these effects is via caching or replication. ...
  • Sclaroff, Stan (Boston University Computer Science Department, 1995-05-27)
    We propose the development of a world wide web image search engine that crawls the web collecting information about the images it finds, computes the appropriate image decompositions and indices, and stores this extracted ...
  • 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 ...
  • Crovella, Mark E.; Carter, Robert L. (Boston University Computer Science Department, 1995-06-30)
    As distributed information services like the World Wide Web become increasingly popular on the Internet, problems of scale are clearly evident. A promising technique that addresses many of these problems is service (or ...
  • Cai, Patrick P.; Bestavros, Azer (Boston University Computer Science Department, 1995-07-18)
    This report describes our attempt to add animation as another data type to be used on the World Wide Web. Our current network infrastructure, the Internet, is incapable of carrying video and audio streams for them to be ...
  • Cunha, Carlos R.; Bestavros, Azer; Crovella, Mark E. (Boston University Computer Science Department, 1995-07-18)
    The explosion of WWW traffic necessitates an accurate picture of WWW use, and in particular requires a good understanding of client requests for WWW documents. To address this need, we have collected traces of actual ...
  • Sclaroff, Stan (Boston University Computer Science Department, 1995-09-12)
    We describe a method for shape-based image database search that uses deformable prototypes to represent categories. Rather than directly comparing a candidate shape with all shape entries in the database, shapes are compared ...
  • 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 ...
  • Gacs, Peter (Boston University Computer Science Department, 1995-11-18)
    Consider a network of processors (sites) in which each site x has a finite set N(x) of neighbors. There is a transition function f that for each site x computes the next state ξ(x) from the states in N(x). But these ...
  • Wells, J.B. (Boston University Computer Science Department, 1995-12-10)
    Mitchell defined and axiomatized a subtyping relationship (also known as containment, coercibility, or subsumption) over the types of System F (with "→" and "∀"). This subtyping relationship is quite simple and does not ...
  • Bestavros, Azer (Boston University Computer Science Department, 1996-01-05)
    The proliferation of mobile computers and wireless networks requires the design of future distributed real-time applications to recognize and deal with the significant asymmetry between downstream and upstream communication ...
  • Ramamritham, Krithi; Sivasankaran, Raju; Stankovic, John; Towsley, Don; Xiong, Ming; Haritsa, Jayant; Seshadri, S.; Kuo, Tei-Wei; Mok, Aloysius; Ulusoy, Ozgur; Buchmann, Alejandro; Lin, Kwei-Jay; Peng, Ching-Shan; Son, Sang; Adelberg, Brad; Garcia-Molina, Hector; Kao, Ben; Andler, S.; Berndtsson, M.; Eftring, B.; Eriksson, J.; Hansson, J.; Mellin, J. (Boston University Computer Science Department, 1996-01-15)
    A Real-Time DataBase System (RTDBS) can be viewed as an amalgamation of a conventional DataBase Management System (DBMS) and a real-time system. Like a DBMS, it has to process transactions and guarantee ACID database ...
  • Bestavros, Azer; Nagy, Sue (Boston University Computer Science Department, 1996-01-15)
    We propose and evaluate an admission control paradigm for RTDBS, in which a transaction is submitted to the system as a pair of processes: a primary task, and a recovery block. The execution requirements of the primary ...
  • Almeida, Virgílio; de Oliveira, Adriana (Boston University Computer Science Department, 1996-02-05)
    The World Wide Web (WWW or Web) is growing rapidly on the Internet. Web users want fast response time and easy access to a enormous variety of information across the world. Thus, performance is becoming a main issue in the ...
  • Heddaya, Abdelsalam; Sinha, Himanshu (Boston University Computer Science Department, 1996-03-07)
    Programmers of parallel processes that communicate through shared globally distributed data structures (DDS) face a difficult choice. Either they must explicitly program DDS management, by partitioning or replicating it ...
  • Wells, J.B. (Boston University Computer Science Department, 1996-03-09)
    System F is the well-known polymorphically-typed λ-calculus with universal quantifiers ("∀"). F+η is System F extended with the eta rule, which says that if term M can be given type τ and M η-reduces to N, then N can also ...
  • Carter, Robert L.; Crovella, Mark, E. (Boston University Computer Science Department, 1996-03-15)
    The quality of available network connections can often have a large impact on the performance of distributed applications. For example, document transfer applications such as FTP, Gopher and the World Wide Web suffer ...

Search OpenBU


Advanced Search

Browse

Deposit Materials