OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Bestavros, Azer; Braoudakis, Spyridon; Panagos, Euthimios (Boston University Computer Science Department, 1993-02-05)
    Speculative Concurrency Control (SCC) [Best92a] is a new concurrency control approach especially suited for real-time database applications. It relies on the use of redundancy to ensure that serializable schedules are ...
  • Thangali, Ashwin; Sclaroff, Stan (Boston University Computer Science Department, 2004-11-02)
    A novel technique to detect and localize periodic movements in video is presented. The distinctive feature of the technique is that it requires neither feature tracking nor object segmentation. Intensity patterns along ...
  • Harfoush, Khaled; Bestavros, Azer; Byers, John (Boston University Computer Science Department, 2002)
    Growing interest in inference and prediction of network characteristics is justified by its importance for a variety of network-aware applications. One widely adopted strategy to characterize network conditions relies on ...
  • 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, ...
  • Baruah, Sanjoy; Bestavros, Azer (Boston University Computer Science Department, 1996-08-22)
    The design of programs for broadcast disks which incorporate real-time and fault-tolerance requirements is considered. A generalized model for real-time fault-tolerant broadcast disks is defined. It is shown that designing ...
  • Jin, Shudong; Bestavros, Azer (Boston University Computer Science Department, 1999-08-21)
    Web caching aims to reduce network traffic, server load, and user-perceived retrieval delays by replicating "popular" content on proxy caches that are strategically placed within the network. While key to effective cache ...
  • Considine, Jeffrey; Walfish, Michael; Anderson, David G. (Boston University Computer Science Department, 2003-12-01)
    Despite the peer-to-peer community's obvious wish to have its systems adopted, specific mechanisms to facilitate incremental adoption have not yet received the same level of attention as the many other practical concerns ...
  • Esposito, Flavio; Matta, Ibrahim (Boston University Computer Science Department, 2009-03-31)
    We consider a Delay Tolerant Network (DTN) whose users (nodes) are connected by an underlying Mobile Ad hoc Network (MANET) substrate. Users can declaratively express high-level policy constraints on how “content” should ...
  • Morcos, Hany; Bestavros, Azer; Matta, Ibrahim (Boston University Computer Science Department, 2009-03-30)
    Controlling the mobility pattern of mobile nodes (e.g., robots) to monitor a given field is a well-studied problem in sensor networks. In this setup, absolute control over the nodes’ mobility is assumed. Apart from the ...
  • 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. ...
  • Kim, Gitae; Bestavros, Azer (Boston University Computer Science Department, 1998-02-09)
    A number of recent studies have pointed out that TCP's performance over ATM networks tends to suffer, especially under congestion and switch buffer limitations. Switch-level enhancements and link-level flow control have ...
  • Kfoury, A.J.; Wells, J.B. (Boston University Computer Science Department, 1998-11-06)
    Principality of typings is the property that for each typable term, there is a typing from which all other typings are obtained via some set of operations. Type inference is the problem of finding a typing for a given term, ...
  • Epstein, Samuel; Mattar, Karim; Matta, Ibrahim (Boston University Computer Science Department, 2009-04-21)
    We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the notion of causation chains where the route flap ...
  • Snyder, Wayne (Boston University Computer Science Department, 1993)
  • Hicks, David; Haake, Anja; Durand, David; Vitali, Fabio (Boston University Computer Science Department, 1996-04-26)
    The workshop entitled "The Role of Version Control in Computer Supported Cooperative Work Applications" was held on September 10, 1995 in Stockholm, Sweden in conjunction with the ECSCW'95 conference. Version control, the ...
  • Doyle, Ronald; Chase, Jeffrey; Gadde, Syam; Vahdat, Amin; Rabinovich, Michael; Sibal, Sandeep; Spatscheck, Oliver; Sturm, Walter; Nottingham, Mark; Kangasharju, Jussi; Roberts, James; Ross, Keith; Radoslavov, Pavlin; Govindan, Ramesh; Estrin, Deborah; Fei, Zongming; Ma, Wei-Ying; Shen, Bo; Brassil, Jack; Beck, Andre; Hofmann, Markus; Ardaiz, O.; Freitag, F.; Navarro, L.; Hughes, Amy; Touch, Joseph; Panteleenko, Vsevolod; Freeh, Vincent; Rost, Stanislav; Byers, John; Bestavros, Azer; Acharya, Arup; Shaikh, Anees; Tewari, Renu; Verma, Dinesh; Coffman, E.G. Jr; Jelenkovic, Predrag; Momcilovic, Petar; Venkataramani, Arun; Yalagandula, Praveen; Kokku, Ravi; Sarif, Sadia; Dahlin, Mike; Davison, Brian; Kelly, Terence; Lee, Johnson; Miniscalco, William; Li, Meng; Shambroom, W. David; Buford, John; Almeida, V.; Menasce, D.; Riedi, R.; Peligrinelli, F.; Fonseca, R.; Meira, W. Jr; Liston, Richard; Zegura, Ellen; Koletsou, Mimika; Voelker, Geoffrey; Krashakov, Serge; Shchur, Lev; Lee, Sung-Ju; Verscheure, Olivier; Venkatramani, Chitra; Frossard, Pascal; Amini, Lisa (Boston University Computer Science Department, 2001-08-02)
    OVERVIEW The International Web Content Caching and Distribution Workshop (WCW) is a premiere technical meeting for researchers and practitioners interested in all aspects of content caching, distribution and ...
  • 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 ...
  • Dimock, Allyn; Westmacott, Ian; Muller, Robert; Turbak, Franklyn; Wells, J.B.; Considine, Jeffrey (Boston University Computer Science Department, 2001)
    The CIL compiler for core Standard ML compiles whole programs using a novel typed intermediate language (TIL) with intersection and union types and flow labels on both terms and types. The CIL term representation duplicates ...
  • Kfoury, A.J.; Hallett, J.J. (Boston University Computer Science Department, 2004-01-22)
    Inferring types for polymorphic recursive function definitions (abbreviated to polymorphic recursion) is a recurring topic on the mailing lists of popular typed programming languages. This is despite the fact that type ...
  • Guirguis, Mina; Bestavros, Azer; Matta, Ibrahim; Riga, Niky; Diamant, Gali; Zhang, Yuting (Boston University Computer Science Department, 2003-12-02)
    The best-effort nature of the Internet poses a significant obstacle to the deployment of many applications that require guaranteed bandwidth. In this paper, we present a novel approach that enables two edge/border routers-which ...

Search OpenBU


Browse

Deposit Materials

Statistics