OpenBU

Browsing College of Arts and Sciences by Title

OpenBU

Browsing College of Arts and Sciences by Title

Sort by: Order: Results:

  • Atlas, Alia; Bestavros, Azer (Boston University Computer Science Department, 1998-09-02)
    Most real-time scheduling problems are known to be NP-complete. To enable accurate comparison between the schedules of heuristic algorithms and the optimal schedule, we introduce an omniscient oracle. This oracle provides ...
  • Yilmaz, Selma; Matta, Ibrahim (Boston University Computer Science Department, 2001)
    The congestion control mechanisms of TCP make it vulnerable in an environment where flows with different congestion-sensitivity compete for scarce resources. With the increasing amount of unresponsive UDP traffic in today's ...
  • Hescott, Benjamin; Koulomzin, Daniel (Boston University Computer Science Department, 2006-02-22)
    The need for the ability to cluster unknown data to better understand its relationship to know data is prevalent throughout science. Besides a better understanding of the data itself or learning about a new unknown object, ...
  • Bera, Debajyoti; Homer, Steve (Boston University Computer Science Department, 2009-06-05)
    We consider a fault model of Boolean gates, both classical and quantum, where some of the inputs may not be connected to the actual gate hardware. This model is somewhat similar to the stuck-at model which is a very popular ...
  • Homer, Steven; Chen, Zhixiang (Boston University Computer Science Department, 1993-12)
    We investigate the problem of learning disjunctions of counting functions, which are general cases of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number p, the class ...
  • Esposito, Flavio; Vegni, Anna Maria; Matta, Ibrahim; Neri, Alessandro (CS Department, Boston University, 2010-09-07)
    Although vehicular ad hoc networks are emerging as a novel paradigm for safety services, supporting real-time applications (e.g., video-streaming, Internet browsing, online gaming, etc.) while maintaining ubiquitous ...
  • Hescott, Ben; Finkelstein, Jeffrey (Computer Science Department, Boston University, 2011-12-20)
    In this paper, we examine a recently introduced type of effective reduction which applies solely to problems of equivalence or isomorphism: the "kernel reduction". Specifically, we examine reductions among languages in the ...
  • Ishakian, Vatche; Akinwumi, Joseph; Esposito, Flavio; Matta, Ibrahim (CS Department, Boston University, 2010-10-15)
    As the Internet has evolved and grown, an increasing number of nodes (hosts or autonomous systems) have become multihomed, i.e., a node is connected to more than one network. Mobility can be viewed as a special case of ...
  • Cosgrove, Elissa J; Gardner, Timothy S; Kolaczyk, Eric D (BioMed Central, 2010-9-9)
    BACKGROUND. Transcriptional regulatory network inference (TRNI) from large compendia of DNA microarrays has become a fundamental approach for discovering transcription factor (TF)-gene interactions at the genome-wide level. ...
  • Przybyszewski, A. W.; Lankheet, M. J. M.; van de Grind, W.A. (Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 1994-10)
    We recorded intracellular responses from cat retinal ganglion cells to sinusoidal flickering lights and compared the response dynamics to a theoretical model based on coupled nonlinear oscillators. Flicker responses for ...
  • Green, Frederic; Homer, Steven; Pollett, Christopher (Boston University Computer Science Department, 2000-01-20)
    For any q > 1, let MOD_q be a quantum gate that determines if the number of 1's in the input is divisible by q. We show that for any q,t > 1, MOD_q is equivalent to MOD_t (up to constant depth). Based on the case q=2, ...
  • Beck, Jacob (Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems, 2000-09)
  • Martin, Michael (University of Chicago Press, 1971)
  • Medina, Alberto; Salamatian, Kave; Taft, Nina; Matta, Ibrahim; Tsang, Yolanda; Diot, Christophe (Boston University Computer Science Department, 2003-02-06)
    Accurate knowledge of traffic demands in a communication network enables or enhances a variety of traffic engineering and network management tasks of paramount importance for operational networks. Directly measuring a ...
  • Ishakian, Vatche; Akinwumi, Joseph; Matta, Ibrahim (Boston University Computer Science Department, 2009-06-19)
    As the Internet has evolved and grown, an increasing number of nodes (hosts or autonomous systems) have become multihomed, i.e., a node is connected to more than one network. Mobility can be viewed as a special case of ...
  • Mattar, Karim; Epstein, Samuel; Matta, Ibrahim (CS Department, Boston University, 2010-04-27)
    The dynamic policy routing model (DPR) was recently introduced to explicitly model the dynamics of policy routing. DPR extends the formalism of the stable paths problem with discrete synchronous time to capture the propagation ...
  • 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 ...
  • Guirguis, Mina; Bestavros, Azer; Matta, Ibrahim (Boston University Computer Science Department, 2003-05-16)
    We postulate that exogenous losses-which are typically regarded as introducing undesirable "noise" that needs to be filtered out or hidden from end points-can be surprisingly beneficial. In this paper we evaluate the effects ...
  • Fayed, Marwan; Krapivsky, Paul; Byers, John; Finkel, David; Redner, Sid; Crovella, Mark (Boston University Computer Science Department, 2003-03-01)
    Recent studies have noted that vertex degree in the autonomous system (AS) graph exhibits a highly variable distribution [15, 22]. The most prominent explanatory model for this phenomenon is the Barabási-Albert (B-A) model ...
  • 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 ...

Search OpenBU


Browse

Deposit Materials

Statistics