Browsing Computer Science by Title

OpenBU

Browsing Computer Science by Title

Sort by: Order: Results:

  • Layered Graphical Models for Tracking Partially-Occluded Objects
    Ablavsky, Vitaly; Thangali, Ashwin; Sclaroff, Stan (Boston University Computer Science Department, 2008-06)
    Partial occlusions are commonplace in a variety of real world computer vision applications: surveillance, intelligent environments, assistive robotics, autonomous navigation, etc. While occlusion handling methods have been ...
  • Learning Actions From the Web
    Ikizler-Cinbis, Nazli; Cinbis, Gokberk; Sclaroff, Stan (CS Department, Boston University, 2010-07-06)
    This paper proposes a generic method for action recognition in uncontrolled videos. The idea is to use images collected from the Web to learn representations of actions and use this knowledge to automatically annotate ...
  • Learning a Family of Detectors
    Yuan, Quan (Boston University Computer Science Department, 2009-06-30)
    Object detection and recognition are important problems in computer vision. The challenges of these problems come from the presence of noise, background clutter, large within class variations of the object class and limited ...
  • Learning Embeddings for Indexing, Retrieval, and Classification, with Applications to Object and Shape Recognition in Image Databases
    Athitsos, Vassilis (Boston University Computer Science Department, 2006-06-14)
    Nearest neighbor retrieval is the task of identifying, given a database of objects and a query object, the objects in the database that are the most similar to the query. Retrieving nearest neighbors is a necessary component ...
  • Learning Euclidean Embeddings for Indexing and Classification
    Athitsos, Vassilis; Alon, Joni; Sclaroff, Stan; Kollios, George (Boston University Computer Science Department, 2004-04-07)
    BoostMap is a recently proposed method for efficient approximate nearest neighbor retrieval in arbitrary non-Euclidean spaces with computationally expensive and possibly non-metric distance measures. Database and query ...
  • Learning Unions of Rectangles with Queries
    Chen, Zhixiang; Homer, Steven (Boston University Computer Science Department, 1993)
    We investigate the efficient learnability of unions of k rectangles in the discrete plane (1,...,n)[2] with equivalence and membership queries. We exhibit a learning algorithm that learns any union of k rectangles with ...
  • Lightweight Formal Methods for the Development of High-Assurance Networking Systems
    Kfoury, Assaf (Boston University Computer Science Department, 2009-12-01)
    We survey several of the research efforts pursued by the iBench and snBench projects in the CS Department at Boston University over the last half dozen years. These activities use ideas and methodologies inspired by recent ...
  • Lightweight Formal Verification in Classroom Instruction of Reasoning about Functional Code
    Lapets, Andrei (Boston University Computer Science Department, 2009-11-06)
    In college courses dealing with material that requires mathematical rigor, the adoption of a machine-readable representation for formal arguments can be advantageous. Students can focus on a specific collection of constructs ...
  • Lightweight Modeling of Java Virtual Machine Security Constraints using Alloy
    Reynolds, Mark C. (Boston University Computer Science Department, 2008-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 component known as the Bytecode ...
  • A Linearization of the Lambda-Calculus and Consequences
    Kfoury, A.J. (Boston University Computer Science Department, 1996-08-19)
    If every lambda-abstraction in a lambda-term M binds at most one variable occurrence, then M is said to be "linear". Many questions about linear lambda-terms are relatively easy to answer, e.g. they all are beta-strongly ...
  • Load Balancing a Cluster of Web Servers using Distributed Packet Rewriting
    Aversa, Luis; Bestavros, Azer (Boston University Computer Science Department, 1999-01-06)
    In this paper, we propose and evaluate an implementation of a prototype scalable web server. The prototype consists of a load-balanced cluster of hosts that collectively accept and service TCP connections. The host IP ...
  • Load Profiling for Efficient Route Selection in Multi-Class Networks
    Bestavros, Azer; Matta, Ibrahim (Boston University Computer Science Department, 1997-05-14)
    High-speed networks, such as ATM networks, are expected to support diverse Quality of Service (QoS) constraints, including real-time QoS guarantees. Real-time QoS is required by many applications such as those that involve ...
  • Load Profiling in Distributed Real-Time Systems
    Bestavros, Azer (Boston University Computer Science Department, 1996-08-01)
    Load balancing is often used to ensure that nodes in a distributed systems are equally loaded. In this paper, we show that for real-time systems, load balancing is not desirable. In particular, we propose a new load-profiling ...
  • A Lower-Bound Result on the Power of a Genetic Algorithm
    Park, Kihong (Boston University Computer Science Department, 1993-07-31)
    This paper presents a lower-bound result on the computational power of a genetic algorithm in the context of combinatorial optimization. We describe a new genetic algorithm, the merged genetic algorithm, and prove that for ...
  • 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 ...

Search OpenBU


Advanced Search

Browse

Deposit Materials