OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Ocean, Michael J.; Kfoury, Assaf J.; Bestavros, Azer (Boston University Computer Science Department, 2006-09-16)
    The emergence of a sensor-networked world produces a clear and urgent need for well-planned, safe and secure software engineering. It is the role of universities to prepare graduates with the knowledge and experience to ...
  • Itkis, Gene; Maiss, Arwa (Boston University Computer Science Department, 2004-04-27)
    Usual password schemes suffer from the flaw that they are easy to steal. An attacker who has correctly observed a login session (by peeping, wiretapping and/or by launching a "man-in-the-middle" attack, etc.) can easily ...
  • Sclaroff, Stan; Del Bimbo, Alberto; Nunziati, Walter (Boston University Computer Science Department, 2005-05-19)
    We introduce a view-point invariant representation of moving object trajectories that can be used in video database applications. It is assumed that trajectories lie on a surface that can be locally approximated with a ...
  • Yuan, Quan; Sclaroff, Stan (Boston University Computer Science Department, 2009-07-12)
    A common design of an object recognition system has two steps, a detection step followed by a foreground within-class classification step. For example, consider face detection by a boosted cascade of detectors followed by ...
  • Diamant, Gali; Veytser, Leonid; Matta, Ibrahim; Bestavros, Azer; Guirguis, Mina; Guo, Liang; Zhang, Yuting; Chen, Sean (Boston University Computer Science Department, 2003-12-16)
    Internet Traffic Managers (ITMs) are special machines placed at strategic places in the Internet. itmBench is an interface that allows users (e.g. network managers, service providers, or experimental researchers) to register ...
  • Matta, Ibrahim; Riga, Niky; Medina, Alberto; Redi, Jason; Partridge, Craig (Boston University Computer Science Department, 2006-09-18)
    Within a recently developed low-power ad hoc network system, we present a transport protocol (JTP) whose goal is to reduce power consumption without trading off delivery requirements of applications. JTP has the following ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...

Search OpenBU


Browse

Deposit Materials

Statistics