Browsing Computer Science by Title

OpenBU

Browsing Computer Science by Title

Sort by: Order: Results:

  • M^2RC: Multiplicative-increase/additive-decrease Multipath Routing Control for Wireless Sensor Networks
    Morcos, Hany; Matta, Ibrahim; Bestavros (Boston University Computer Science Department, 2004-07-14)
    Routing protocols in wireless sensor networks (WSN) face two main challenges: first, the challenging environments in which WSNs are deployed negatively affect the quality of the routing process. Therefore, routing protocols ...
  • Mapping Parallel Iterative Algorithms onto Workstation Networks
    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 ...
  • Measuring Bottleneck Bandwidth of Targeted Path Segments
    Harfoush, Khaled; Bestavros, Azer; Byers, John (Boston University Computer Science Department, 2001-07-31)
    Accurate measurement of network bandwidth is crucial for flexible Internet applications and protocols which actively manage and dynamically adapt to changing utilization of network resources. These applications must do so ...
  • Measuring Bottleneck Link Speed in Package-Switched Networks
    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 ...
  • Measuring the Behavior of a World-Wide Web Server
    Almeida, Jussara; Almeida, Virgílio; Yates, David J. (Boston University Computer Science Department, 1996-10-29)
    Server performance has become a crucial issue for improving the overall performance of the World-Wide Web. This paper describes Webmonitor, a tool for evaluating and understanding server performance, and presents new results ...
  • Measuring Web Performance in the Wide Area
    Barford, Paul; Crovella, Mark (Boston University Computer Science Department, 1999-04-23)
    One of the most vexing questions facing researchers interested in the World Wide Web is why users often experience long delays in document retrieval. The Internet's size, complexity, and continued growth make this a difficult ...
  • Mermera: Non-Coherent Distributed Shared Memory for Parallel Computing
    Sinha, Himanshu Shekhar (Boston University Computer Science Department, 1993-04)
    The proliferation of inexpensive workstations and networks has prompted several researchers to use such distributed systems for parallel computing. Attempts have been made to offer a shared-memory programming model on such ...
  • A Minimal GB Parser
    Marwan, Shaban (Boston University Computer Science Department, 1993-10-26)
    We describe a GB parser implemented along the lines of those written by Fong [4] and Dorr [2]. The phrase structure recovery component is an implementation of Tomita's generalized LR parsing algorithm (described in [10]), ...
  • Mining Anomalies Using Traffic Feature Distributions
    Lakhina, Anukool; Mark, Crovella; Diot, Christophe (Boston University Computer Science Department, 2005-10-05)
    The increasing practicality of large-scale flow capture makes it possible to conceive of traffic analysis methods that detect and identify a large and diverse set of anomalies. However the challenge of effectively analyzing ...
  • Mistreatment in Distributed Caching Groups: Causes and Implications
    Laoutaris, Nikolaos; Smaragdakis, Georgios; Bestavros, Azer; Ioannis Stavrakakis (Boston University Computer Science Department, 2005-07-07)
    Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the appearance of potential mistreatment problems ...
  • Modal Matching for Correspondence and Recognition
    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 ...
  • Modeling the Java Bytecode Verifier
    Reynolds, Mark C. (Boston University Computer Science Department, 2009-12-30)
    The Java programming language has been widely described as secure by design. Nevertheless, a number of serious security vulnerabilities have been discovered in Java, particularly in the Bytecode Verifier, a critical component ...
  • MosaicShape: Stochastic Region Grouping with Shape Prior
    Wang, Jingbin; Gu, Erdan; Betke, Margrit (Boston University Computer Science Department, 2005-02-27)
    A novel method that combines shape-based object recognition and image segmentation is proposed for shape retrieval from images. Given a shape prior represented in a multi-scale curvature form, the proposed method identifies ...
  • Multiplexing VBR Traffic Flows with Guaranteed Application-level QoS Using Statistical Rate Monotonic Scheduling
    Atlas, Alia; Bestavros, Azer (Boston University Computer Science Department, 1998-05-02)
    Quality of Service (QoS) guarantees are required by an increasing number of applications to ensure a minimal level of fidelity in the delivery of application data units through the network. Application-level QoS does not ...
  • Multiplicative Kernels: Object Detection, Segmentation and Pose Estimation
    Yuan, Quan; Thangali, Ashwin; Ablavsky, Vitaly; Sclaroff, Stan (Boston University Computer Science Department, 2008-06)
    Object detection is challenging when the object class exhibits large within-class variations. In this work, we show that foreground-background classification (detection) and within-class classification of the foreground ...
  • Multi-Scale 3D Scene Flow from Binocular Stereo Sequences
    Li, Rui; Sclaroff, Stan (Boston University Computer Science Department, 2007-06)
    Scene flow methods estimate the three-dimensional motion field for points in the world, using multi-camera video data. Such methods combine multi-view reconstruction with motion estimation. This paper describes an alternative ...
  • Multi-scale 3D Scene Flow from Binocular Stereo Sequences
    Li, Rui; Sclaroff, Stan (Boston University Computer Science Department, 2004-11-02)
    Scene flow methods estimate the three-dimensional motion field for points in the world, using multi-camera video data. Such methods combine multi-view reconstruction with motion estimation approaches. This paper describes ...
  • Multi-version Speculative Concurrency Control with Delayed Commit
    Bestavros, Azer; Wang, Biao (Boston University Computer Science Department, 1993-10-27)
    This paper presents an algorithm which extends the relatively new notion of speculative concurrency control by delaying the commitment of transactions, thus allowing other conflicting transactions to continue execution and ...
  • Music Maker – A Camera-based Music Making Tool for Physical Rehabilitation
    Gorman, Mikhail; Betke, Margrit; Saltzman, Elliot; Lahav, Amir (Boston University Computer Science Department, 2005-12-08)
    The therapeutic effects of playing music are being recognized increasingly in the field of rehabilitation medicine. People with physical disabilities, however, often do not have the motor dexterity needed to play an ...
  • Nearest-neighbor Queries in Probabilistic Graphs
    Potamias, Michalis; Bonchi, Francesco; Gionis, Aristides; Kollios, George (Boston University Computer Science Department, 2009-07-14)
    Large probabilistic graphs arise in various domains spanning from social networks to biological and communication networks. An important query in these graphs is the k nearest-neighbor query, which involves finding and ...

Search OpenBU


Advanced Search

Browse

Deposit Materials