OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • 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 ...
  • 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 ...
  • Brogle, Kyle; Cooper, Danny; Goldberg, Sharon; Reyzin, Leonid (Computer Science Department, Boston University, 2013-01-07)
    The RPKI is an infrastructure that will provide digitally signed attestations for the hierarchical allocation and suballocation of IP addresses. Its goal is to improve security of interdomain routing by providing reliable ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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. ...
  • 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 ...
  • 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 ...
  • Wang, Chong; Byers, John (Computer Science Department, Boston University, 2012-06-20)
    With the primacy of content driving the design of new network architectures as well as the successful CDN business model, it is instructive to reconsider problems of content placement from the context of ISPs. In particular, ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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) ...
  • 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 ...
  • Gursun, Gonca (Computer Science Department, Boston University, 2013-09-27)
    The Internet is a large-scale decentralized system that is composed of thousands of independent networks. In this system, there are two main components, interdomain routing and traffic, that are vital inputs for many tasks ...
  • 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 ...
  • 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 ...
  • 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 ...

Search OpenBU


Browse

Deposit Materials

Statistics