Browsing CAS: Computer Science: Technical Reports by Issue Date

OpenBU

Browsing CAS: Computer Science: Technical Reports by Issue Date

Sort by: Order: Results:

  • Jahama, Said; Kfoury, A. J. (Boston University Computer Science Department, 1993-12-20)
    We establish the equivalence of type reconstruction with polymorphic recursion and recursive types is equivalent to regular semi-unification which proves the undecidability of the corresponding type reconstruction problem. ...
  • Braoudakis, Spyridon; Bestavros, Azer (Boston University Computer Science Department, 1994)
    Various concurrency control algorithms differ in the time when conflicts are detected, and in the way they are resolved. In that respect, the Pessimistic and Optimistic Concurrency Control (PCC and OCC) alternatives represent ...
  • Bestavros, Azer (Boston University Computer Science Department, 1994)
    Predictability — the ability to foretell that an implementation will not violate a set of specified reliability and timeliness requirements - is a crucial, highly desirable property of responsive embedded systems. This ...
  • Homer, Steven; Peinado, Marcus (Boston University Computer Science Department, 1994)
    The performance of a randomized version of the subgraph-exclusion algorithm (called Ramsey) for CLIQUE by Boppana and Halldorsson is studied on very large graphs. We compare the performance of this algorithm with the ...
  • Heddaya, Abdelsalam; Park, Kihong (Boston University Computer Science Department, 1994-02-07)
    For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally ...
  • Kfoury, A.J.; Wells, J.B. (Boston University Computer Science Department, 1994-03-16)
    The ML programming language restricts type polymorphism to occur only in the "let-in" construct and requires every occurrence of a formal parameter of a function (a lambda abstraction) to have the same type. Milner in 1978 ...
  • Shaban, Marwan (Boston University Computer Science Department, 1994-03-22)
    By utilizing structure sharing among its parse trees, a GB parser can increase its efficiency dramatically. Using a GB parser which has as its phrase structure recovery component an implementation of Tomita's algorithm (as ...
  • 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 ...
  • Sclaroff, Stan; Pentland, Alex (Boston University Computer Science Department, 1994-10)
    We describe our work on shape-based image database search using the technique of modal matching. Modal matching employs a deformable shape decomposition that allows users to select example objects and have the computer ...
  • Sclaroff, Stan; Pentland, Alex (Boston University Computer Science Department, 1994-11)
    Nonrigid motion can be described as morphing or blending between extremal shapes, e.g., heart motion can be described as transitioning between the systole and diastole states. Using physically-based modeling techniques, ...
  • Carter, Bob; Park, Kihong (Boston University Computer Science Department, 1994-11-10)
    In this paper, we study the efficacy of genetic algorithms in the context of combinatorial optimization. In particular, we isolate the effects of cross-over, treated as the central component of genetic search. We show that ...
  • Heddaya, Abdelsalam; Fahmy, Amr (Boston University Computer Science Department, 1994-12-05)
    Predictability -- the ability to foretell that an implementation will not violate a set of specified reliability and timeliness requirements -- is a crucial, highly desirable property of responsive embedded systems. This ...
  • Oliart, Alberto (Boston University Computer Science Department, 1994-12-14)
    This report presents an algorithm, and its implementation, for doing type inference in the context of Quasi-Static Typing (QST) ["Quasy-static Typing." Satish Thatte Proc. ACM Symp. on Principles of Programming Languages, ...
  • 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 ...
  • Bestavros, Azer; Carter, Robert L.; Crovella, Mark E.; Cunha, Carlos R.; Heddaya, Abdelsalam; Mirdad, Sulaiman A. (Boston University Computer Science Department, 1995-01-15)
    With the increasing demand for document transfer services such as the World Wide Web comes a need for better resource management to reduce the latency of documents in these systems. To address this need, we analyze the ...
  • Tiuryn, Jerzy (Boston University Computer Science Department, 1995-02)
    Two polymorphic types σ and τ are said to be bicoercible if there is a coercion from σ to τ and conversely. We give a complete equational axiomatization of bicoercible types and prove that the relation of bicoercibility ...
  • Durand, David; Haake, Anja; Hicks, David; Vitali, Fabio (Boston University Computer Science Department, 1995-02-07)
    This report contains 9 papers presented at a workshop on version management and hypertext, as well as a summary introduction by the organizers. These papers address requirements, solutions, and research issues related to ...
  • Bestavros, Azer (Boston University Computer Science Department, 1995-02-07)
    We analyzed the logs of our departmental HTTP server http://cs-www.bu.edu as well as the logs of the more popular Rolling Stones HTTP server http://www.stones.com. These servers have very different purposes; the former ...
  • Bestavros, Azer; Braoudakis, Spyridon (Boston University Computer Science Department, 1995-02-20)
    A problem with Speculative Concurrency Control algorithms and other common concurrency control schemes using forward validation is that committing a transaction as soon as it finishes validating, may result in a value loss ...
  • Bestavros, Azer (Boston University Computer Science Department, 1995-02-21)
    Speculative service implies that a client's request for a document is serviced by sending, in addition to the document requested, a number of other documents (or pointers thereto) that the server speculates will be requested ...

Search OpenBU


Advanced Search

Browse

Deposit Materials