Browsing Computer Science by Title

OpenBU

Browsing Computer Science by Title

Sort by: Order: Results:

  • Effectiveness of Loss labeling in Improving TCP Performance in Wired/Wireless Networks
    Barman, Dhiman; Matta, Ibrahim (Boston University Computer Science Department, 2002)
    The current congestion-oriented design of TCP hinders its ability to perform well in hybrid wireless/wired networks. We propose a new improvement on TCP NewReno (NewReno-FF) using a new loss labeling technique to discriminate ...
  • Efficient End-Host Architecture for High Performance Communication Using User-level Sandboxing
    Qi, Xin; Parmer, Gabriel; West, Richard; Gloudon, Jason; Hernandez, Luis (Boston University Computer Science Department, 2004-03-01)
    Current low-level networking abstractions on modern operating systems are commonly implemented in the kernel to provide sufficient performance for general purpose applications. However, it is desirable for high performance ...
  • Efficient Hash-Consing of Recursive Types
    Considine, Jeffrey (Boston University Computer Science Department, 2000-01-21)
    Efficient storage of types within a compiler is necessary to avoid large blowups in space during compilation. Recursive types in particular are important to consider, as naive representations of recursive types may be ...
  • Efficiently and Fairly Allocating Bandwidth at a Highly Congested Link
    Wang, Tao; Matta, Ibrahim; Bestavros, Azer (Boston University Computer Science Department, 2003-12-02)
    We consider the problem of efficiently and fairly allocating bandwidth at a highly congested link to a diverse set of flows, including TCP flows with various Round Trip Times (RTT), non-TCP-friendly flows such as ...
  • Efficient Nearest Neighbor Classification Using a Cascade of Approximate Similarity Measures
    Athitsos, Vassilis; Alon, Jonathan; Sclaroff, Stan (Boston University Computer Science Department, 2005-03-16)
    Nearest neighbor classification using shape context can yield highly accurate results in a number of recognition problems. Unfortunately, the approach can be too slow for practical applications, and thus approximation ...
  • Efficient Support for Common Relations in Lightweight Formal Reasoning Systems
    Lapets, Andrei; House, DAvid (Boston University Computer Science Department, 2009-11-06)
    In work that involves mathematical rigor, there are numerous benefits to adopting a representation of models and arguments that can be supplied to a formal reasoning or verification system: reusability, automatic evaluation ...
  • An Efficient User-Level Shared Memory Mechanism for Application-Specific Extensions
    West, Richard; Gloudon, Jason; Qi, Xin; Parmer, Gabriel; Gloudon, Jason (Boston University Computer Science Department, 2005-02-23)
    This paper focuses on an efficient user-level method for the deployment of application-specific extensions, using commodity operating systems and hardware. A sandboxing technique is described that supports multiple extensions ...
  • The EGOIST Overlay Routing System
    Smaragdakis, Georgios; Lekakis, Vassilis; Laoutaris, Nikolaos; Bestavros, Azer; Byers, John W.; Roussopoulos, Mema (Boston University Computer Science Department, 2008-07-01)
    A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals into an existing overlay, and rewiring to ...
  • EGOIST: Overlay Routing Using Selfish Neighbor Selection
    Smaragdakis, Georgios; Laoutaris, Nikolaos; Bestavros, Azer; Byers, John W.; Roussopoulos, Mema (Boston University Computer Science Department, 2007)
    A foundational issue underlying many overlay network applications ranging from routing to P2P file sharing is that of connectivity management, i.e., folding new arrivals into an existing overlay, and re-wiring to cope with ...
  • Embedding Games
    Londono, Jorge (CS Department, Boston University, 2010-07-20)
    Large scale distributed computing infrastructures pose challenging resource management problems, which could be addressed by adopting one of two perspectives. On the one hand, the problem could be framed as a global ...
  • End-to-End Inference of Loss Nature in a Hybrid Wired/Wireless Environment
    Liu, Jun; Matta, Ibrahim; Crovella, Mark (Boston University Computer Science Department, 2002-03-14)
    End-to-End differentiation between wireless and congestion loss can equip TCP control so it operates effectively in a hybrid wired/wireless environment. Our approach integrates two techniques: packet loss pairs (PLP) and ...
  • An Energy-conscious Transport Protocol for Multi-hop Wireless Networks
    Riga, N.; Matta, I.; Medina, A.; Partridge, C.; Redi, J. (Boston University Computer Science Department, 2007)
    We present a transport protocol whose goal is to reduce power consumption without compromising delivery requirements of applications. To meet its goal of energy efficiency, our transport protocol (1) contains mechanisms ...
  • Entropy Loss is Maximal for Uniform Inputs
    Reyzin, Leonid (Boston University Computer Science Department, 2007-09-20)
    A secure sketch (defined by Dodis et al.) is an algorithm that on an input w produces an output s such that w can be reconstructed given its noisy version w' and s. Security is defined in terms of two parameters m and m˜ : ...
  • Equational Axiomization of Bicoercibility for Polymorphic Types
    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 ...
  • Ergodicity and Mixing Rate of One-Dimensional Cellular Automata
    Park, Kihong (Boston University Computer Science Department, 1996-07-22)
    One-and two-dimensional cellular automata which are known to be fault-tolerant are very complex. On the other hand, only very simple cellular automata have actually been proven to lack fault-tolerance, i.e., to be mixing. ...
  • Estimating 3D Body Pose Using Uncalibrated Cameras
    Rosales, Rómer; Siddiqui, Matheen; Alon, Jonathan; Sclaroff, Stan (Boston University Computer Science Department, 2001-06)
    An approach for estimating 3D body pose from multiple, uncalibrated views is proposed. First, a mapping from image features to 2D body joint locations is computed using a statistical framework that yields a set of several ...
  • Estimating 3D Hand Pose from a Cluttered Image
    Athitsos, Vassilis; Sclaroff, Stan (Boston University Computer Science Department, 2003-04-01)
    A method is proposed that can generate a ranked list of plausible three-dimensional hand configurations that best match an input image. Hand pose estimation is formulated as an image database indexing problem, where the ...
  • Estimating Human Body Pose from a Single Image via the Specialized Mappings Architecture
    Rosales, Romer; Sclaroff, Stan (Boston University Computer Science Department, 2000-06-10)
    A non-linear supervised learning architecture, the Specialized Mapping Architecture (SMA) and its application to articulated body pose reconstruction from single monocular images is described. The architecture is formed ...
  • Estimation and Prediction of Evolving Color Distributions for Skin Segmentation Under Varying Illumination
    Sigal, Leonid; Sclaroff, Stan; Athitsos, Vassilis (Boston University Computer Science Department, 1999-12-01)
    A novel approach for real-time skin segmentation in video sequences is described. The approach enables reliable skin segmentation despite wide variation in illumination during tracking. An explicit second order Markov model ...
  • Evaluation of a Load Profiling Approach to Routing Guaranteed Bandwidth Flows
    Matta, Ibrahim; Bestavros, Azer (Boston University Computer Science Department, 1997-07-30)
    To support the diverse Quality of Service (QoS) requirements of real-time (e.g. audio/video) applications in integrated services networks, several routing algorithms that allow for the reservation of the needed bandwidth ...

Search OpenBU


Advanced Search

Browse

Deposit Materials