OpenBU

Browsing College of Arts and Sciences by Title

OpenBU

Browsing College of Arts and Sciences by Title

Sort by: Order: Results:

  • Fenner, Stephen; Green, Frederic; Homer, Steven; Pruim, Randall (Boston University Computer Science Department, 2000-01-20)
    It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether ...
  • Cunha, Carlos R.; Jaccoud, Carlos F.B. (Boston University Computer Science Department, 1997-03-26)
    World-Wide Web (WWW) services have grown to levels where significant delays are expected to happen. Techniques like pre-fetching are likely to help users to personalize their needs, reducing their waiting times. However, ...
  • 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 ...
  • Morcos, Hany; Bestavros, Azer; Matta, Ibrahim (Boston University Computer Science Department, 2008-02-10)
    Commonly, research work in routing for delay tolerant networks (DTN) assumes that node encounters are predestined, in the sense that they are the result of unknown, exogenous processes that control the mobility of these ...
  • van Heijst, J.J.; Vos, J.E.; Bullock, D. (Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 1997-11)
    In two phases, we develop neural network models of spinal circuitry which self-organises into networks with opponent channels for the control of an antagonistic muscle pair. The self-organisation is enabled by spontaneous ...
  • Lakhina, Anukool; Crovella, Mark; Diot, Christophe (Boston University Computer Science Department, 2004-02-24)
    Anomalies are unusual and significant changes in a network's traffic levels, which can often involve multiple links. Diagnosing anomalies is critical for both network operators and end users. It is a difficult problem ...
  • Kfoury, Assaf; Mizraei, Saber (Computer Science Department, Boston University, 2012-12-10)
    We review elements of a typing theory for flow networks, which we expounded in an earlier report (BUCS TR 2018). To illustrate the way in which this typing theory offers an alternative framework for the design and analysis ...
  • Guo, Liang; Matta, Ibrahim (Boston University Computer Science Department, 2002)
    Internet measurements show that the size distribution of Web-based transactions is usually very skewed; a few large requests constitute most of the total traffic. Motivated by the advantages of scheduling algorithms which ...
  • Matta, Ibrahim; Guo, Liang (Boston University Computer Science Department, 2000-05-17)
    The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has recently spurred further investigations into its congestion ...
  • Charpy, Loic; Palinska, Katarzyna A.; Casareto, Beatriz; Langlade, Marie José; Suzuki, Yoshimi; Abed, Raeid M. M.; Golubic, Stjepko (Springer-Verlag, 2009-8-25)
    Dinitrogen-fixing organisms in cyanobacterial mats were studied in two shallow coral reef ecosystems: La Reunion Island, southwestern Indian Ocean, Sesoko (Okinawa) Island, and northwestern Pacific Ocean. Rapidly expanding ...
  • Riga, Niky; Matta, Ibrahim; Bestavros, Azer (Boston University Computer Science Department, 2004-05-31)
    Wireless sensor networks have recently emerged as enablers of important applications such as environmental, chemical and nuclear sensing systems. Such applications have sophisticated spatial-temporal semantics that set ...
  • Kfoury, A. J.; Wells, J. B. (Boston University Department of Computer Science, 1993-12-01)
    We study the problem of type inference for a family of polymorphic type disciplines containing the power of Core-ML. This family comprises all levels of the stratification of the second-order lambda-calculus by "rank" of ...
  • Chelian, Suhas; Carpenter, Gail (Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 2005-03)
    The DISCOV (Dimensionless Shunting Colour Vision) system models a cascade of primate colour vision cells: retinal ganglion, thalamic single opponent, and two classes of cortical double opponents. A unified model fotmalism ...
  • Parikh, Jignesh R.; Klinger, Bertram; Xia, Yu; Marto, Jarrod A.; Blüthgen, Nils (Oxford University Press, 2010-5-21)
    High-throughput gene-expression studies result in lists of differentially expressed genes. Most current meta-analyses of these gene lists include searching for significant membership of the translated proteins in various ...
  • Alon, Jonathan; Sclaroff, Stan; Kollios, George; Pavlovic, Vladimir (Boston University Computer Science Department, 2003-03-26)
    A new approach is proposed for clustering time-series data. The approach can be used to discover groupings of similar object motions that were observed in a video collection. A finite mixture of hidden Markov models (HMMs) ...
  • Papapetrou, Panagiotis; Benson, Gary; Kollios, George (Boston University Computer Science Department, 2006-10-15)
    The problem of discovering frequent arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence is studied, and two efficient approaches are proposed to solve it. The first approach ...
  • Bestavros, Azer (Boston University Computer Science Department, 1997-09-10)
    In this paper, we introduce the notion of a "document cluster" in WWW space as a generalization of the notion of a "cache line" in linear memory address space. Through the analysis of Web server logs, we show evidence of ...
  • Carpenter, Gail A. (Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 1996-02)
    Adaptive resonance theory (ART) models have been used for learning and prediction in a wide variety of applications. Winner-take-all coding allows these networks to maintain stable memories, but this type of code representation ...
  • Carpenter, Gail A. (Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 1996-02)
    Adaptive resonance theory (ART) models have been used for learning and prediction in a wide variety of applications. Winner-take-all coding allows these networks to maintain stable memories, but this type of code representation ...
  • Carpenter, Gail A.; Milenova, Boriana L. (Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 1999-05)
    Distributed coding at the hidden layer of a multi-layer perceptron (MLP) endows the network with memory compression and noise tolerance capabilities. However, an MLP typically requires slow off-line learning to avoid ...

Search OpenBU


Browse

Deposit Materials

Statistics