Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Image Digestion and Relevance Feedback in the ImageRover WWW Search Engine
    Taycher, Leonid; La Cascia, Marco; Sclaroff, Stan (Boston University Computer Science Department, 1997-08-14)
    ImageRover is a search by image content navigation tool for the world wide web. The staggering size of the WWW dictates certain strategies and algorithms for image collection, digestion, indexing, and user interface. This ...
  • ImageRover: A Content-Based Image Browser for the World Wide Web
    Sclaroff, Stan; Taycher, Leonid; La Cascia, Marco (Boston University Computer Science Department, 1997-03-24)
    ImageRover is a search by image content navigation tool for the world wide web. To gather images expediently, the image collection subsystem utilizes a distributed fleet of WWW robots running on different computers. The ...
  • An Implementation of Mermera: A Shared Memory System that Mixes Coherence with Non-coherence
    Heddaya, Abdelsalam; Sinha, Himanshu (Boston University Computer Science Department, 1993-06-04)
    Coherent shared memory is a convenient, but inefficient, method of inter-process communication for parallel programs. By contrast, message passing can be less convenient, but more efficient. To get the benefits of both ...
  • Implications of Selfish Neighbor Selection in Overlay Networks
    Laoutaris, Nikolaos; Smaragdakis, Georgios; Bestavros, Azer; Byers, John W. (Boston University Computer Science Department, 2006-07-14)
    In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select ...
  • An Improved Robust Fuzzy Extractor
    Kanukurth, Bhavana (Boston University Computer Science Department, 2009)
    We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, W' to agree on a secret key R in the presence of an active adversary. Robust fuzzy extractors were ...
  • Improved Tracking of Multiple Humans with Trajectory Prediction and Occlusion Modeling
    Rosales, Romer; Sclaroff, Stan (Boston University Computer Science Department, 1998-03-16)
    A combined 2D, 3D approach is presented that allows for robust tracking of moving bodies in a given environment as observed via a single, uncalibrated video camera. Tracking is robust even in the presence of occlusions. ...
  • Improving the Accessibility of Lightweight Formal Verification Systems
    Lapets, Andrei (Boston University Computer Science Department, 2009-04-30)
    In research areas involving mathematical rigor, there are numerous benefits to adopting a formal representation of models and arguments: reusability, automatic evaluation of examples, and verification of consistency and ...
  • Improving the Performance of Overlay Routing and P2P File Sharing using Selfish Neighbor Selection
    Smaragdakis, Georgios; Laoutaris, Nikolaos; Bestavros, Azer; Byers, John; 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 the existing mesh and re-wiring to cope with ...
  • An Independent-Connection Model for Traffic Matrices
    Erramilli, Vijay; Crovella, Mark; Taft, Nina (Boston University Computer Science Department, 2006-09-06)
    A common assumption made in traffic matrix (TM) modeling and estimation is independence of a packet's network ingress and egress. We argue that in real IP networks, this assumption should not and does not hold. The fact ...
  • Indexing Distances in Large Graphs and Applications in Search Tasks
    Potamias, Michalis (Boston University Computer Science Department, 2009)
    This thesis elaborates on the problem of preprocessing a large graph so that single-pair shortest-path queries can be answered quickly at runtime. Computing shortest paths is a well studied problem, but exact algorithms ...
  • Indexing Methods for Efficient Multiclass Recognition
    Stefan, Alexandra (Boston University Computer Science Department, 2008)
    Many real world image analysis problems, such as face recognition and hand pose estimation, involve recognizing a large number of classes of objects or shapes. Large margin methods, such as AdaBoost and Support Vector ...
  • Index Trees for Efficient Deformable Shape-based Retrieval
    Liu, Lifeng; Sclaroff, Stan (Boston University Computer Science Department, 2000-03-22)
    An improved method for deformable shape-based image indexing and retrieval is described. A pre-computed index tree is used to improve the speed of our previously reported on-line model fitting method; simple shape features ...
  • Inference and Labeling of Metric-Induced Network Topologies
    Bestavros, Azer; Byers, John; Harfoush, Khaled (Boston University Computer Science Department, 2001-05)
    The development and deployment of distributed network-aware applications and services over the Internet require the ability to compile and maintain a model of the underlying network resources with respect to (one or more) ...
  • Inferring Body Pose without Tracking Body Parts
    Rosales, Romer; Sclaroff, Stan (Boston University Computer Science Department, 1999-12-01)
    A novel approach for estimating articulated body posture and motion from monocular video sequences is proposed. Human pose is defined as the instantaneous two dimensional configuration (i.e., the projection onto the image ...
  • Inferring Intersection Typings that are Equivalent to Call-by-Name and Call-by-Value Evaluations
    Bakewell, Adam; Carlier, Sébastien; Kfoury, A. J.; Wells, J. B. (Boston University Computer Science Department, 2005-12-30)
    We present a procedure to infer a typing for an arbitrary λ-term M in an intersection-type system that translates into exactly the call-by-name (resp., call-by-value) evaluation of M. Our framework is the recently developed ...
  • An Infinite Pebble Game and Applications
    Kfoury, A.J.; Stolboushkin, A.P. (Boston University Computer Science Department, 1996-08-15)
    We generalize the well-known pebble game to infinite dag's, and we use this generalization to give new and shorter proofs of results in different areas of computer science (as diverse as "logic of programs" and "formal ...
  • An Information Theoretic Framework for Field Monitoring Using Autonomously Mobile Sensors
    Morcos, Hany; Atia, George; Bestavros, Azer; Matta, Ibrahim (Boston University Computer Science Department, 2008-02-10)
    We consider a mobile sensor network monitoring a spatio-temporal field. Given limited cache sizes at the sensor nodes, the goal is to develop a distributed cache management algorithm to efficiently answer queries with a ...
  • Informed Content Delivery Across Adaptive Overlay Networks
    Byers, John; Considine, Jeffrey; Mitzenmacher, Michael; Rost, Stanislav (Boston University Computer Science Department, 2002)
    Overlay networks have emerged as a powerful and highly flexible method for delivering content. We study how to optimize throughput of large, multipoint transfers across richly connected overlay networks, focusing on the ...
  • An Infrastructure for the Dynamic Distribution of Web Applications and Services
    Duvos, Enrique; Bestavros, Azer (Boston University Computer Science Department, 2000-12-15)
    This paper presents the design and implementation of an infrastructure that enables any Web application, regardless of its current state, to be stopped and uninstalled from a particular server, transferred to a new server, ...
  • An Integrated Approach for Segmentation and Estimation of Planar Structures
    Alon, Jonathan; Sclaroff, Stan (Boston University Computer Science Department, 2000-12-04)
    Standard structure from motion algorithms recover 3D structure of points. If a surface representation is desired, for example a piece-wise planar representation, then a two-step procedure typically follows: in the first ...

Search OpenBU


Advanced Search

Browse

Deposit Materials