Browsing Computer Science by Title

OpenBU

Browsing Computer Science by Title

Sort by: Order: Results:

  • Nearest-neighbor Queries in Probabilistic Graphs
    Potamias, Michalis; Bonchi, Francesco; Gionis, Aristides; Kollios, George (Boston University Computer Science Department, 2009-07-14)
    Large probabilistic graphs arise in various domains spanning from social networks to biological and communication networks. An important query in these graphs is the k nearest-neighbor query, which involves finding and ...
  • NETEMBED: A Network Resource Mapping Service for Distributed Applications
    Londono, Jorge; Bestavros, Azer (Boston University Computer Science Department, 2006-12-15)
    Emerging configurable infrastructures such as large-scale overlays and grids, distributed testbeds, and sensor networks comprise diverse sets of available computing resources (e.g., CPU and OS capabilities and memory ...
  • The Network Effects of Prefetching
    Crovella, Mark; Barford, Paul (Boston University Computer Science Department, 1997-07-10)
    Prefetching has been shown to be an effective technique for reducing user perceived latency in distributed systems. In this paper we show that even when prefetching adds no extra traffic to the network, it can have serious ...
  • "Networking is IPC": A Guiding Principle to a Better Internet
    Day, John; Matta, Ibrahim; Mattar, Karim (Boston University Computer Science Department, 2008-08-15)
    This position paper outlines a new network architecture, i.e., a style of construction that identifies the objects and how they relate. We do not specify particular protocol implementations or specific interfaces and ...
  • A New Lower Bound Technique for Quantum Circuits without Ancillae
    Bera, Debajyoti (Boston University Computer Science Department, 2008-07-22)
    We present a technique to derive depth lower bounds for quantum circuits. The technique is based on the observation that in circuits without ancillae, only a few input states can set all the control qubits of a Toffoli ...
  • New Notions of Reduction and Non-Semantic Proofs of β-Strong Normalization in Typed λ-Calculi
    Kfoury, A.J.; Wells, J.B. (Boston University Computer Science Department, 1994-12-19)
    Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether a λ-term is beta-strongly normalizing is reduced to the question of whether a λ-term is merely normalizing under one of ...
  • A New Version of Toom's Proof
    Gacs, Peter (Boston University Computer Science Department, 1995-03-27)
    There are several proofs now for the stability of Toom's example of a two-dimensional stable cellular automaton and its application to fault-tolerant computation. Simon and Berman simplified and strengthened Toom's original ...
  • Non-Rigid Shape from Image Streams
    Sclaroff, Stan; Alon, Jonathan (Boston University Computer Science Department, 1999-07-27)
    We present a framework for estimating 3D relative structure (shape) and motion given objects undergoing nonrigid deformation as observed from a fixed camera, under perspective projection. Deforming surfaces are approximated ...
  • Non-Uniform Reductions
    Buhrman, Harry; Hescott, Benjamin; Homer, Steven; Torenvliet, Leen (Boston University Computer Science Department, 2008-02-15)
    We study properties of non-uniform reductions and related completeness notions. We strengthen several results of Hitchcock and Pavan and give a trade-off between the amount of advice needed for a reduction and its honesty ...
  • A Note On the Statistical Difference of Small Direct Products
    Reyzin, Leonid (Boston University Computer Science Department, 2004-09-21)
    We demonstrate that if two probability distributions D and E of sufficiently small min-entropy have statistical difference ε, then the direct-product distributions D^l and E^l have statistical difference at least roughly ...
  • Notes on the Effect of Different Access Patterns on the Intensity of Mistreatment in Distributed Caching Groups
    Smaragdakis, Georgios (Boston University Computer Science Department, 2006-09-18)
    In this report, we extend our study of the intensity of mistreatment in distributed caching groups due to state interaction. In our earlier work (published as BUCS-TR-2006-003), we analytically showed how this type of ...
  • The NP-completeness of the Restricted Stable Paths Problem with Three Aggregating Functions
    Lapets, Andrei; Kfoury, Assaf (CS Department, Boston University, 2010-03-14)
    Interdomain routing on the internet is performed using route preference policies specified independently and arbitrarily by each autonomous system (AS) in the network. These policies are used in the border gateway protocol ...
  • Object Detection at the Optimal Scale with Hidden State Shape Models
    Wang, Jingbin; Athitsos, Vassilis; Sclaroff, Stan; Betke, Margrit (Boston University Computer Science Department, 2006-10-02)
    Hidden State Shape Models (HSSMs) [2], a variant of Hidden Markov Models (HMMs) [9], were proposed to detect shape classes of variable structure in cluttered images. In this paper, we formulate a probabilistic framework ...
  • Object Matching in Distributed Video Surveillance Systems by LDA-Based Appearance Descriptors
    Presti, Liliana Lo; Sclaroff, Stan; La Casica, Marco (Boston University Computer Science Department, 2009-05-18)
    Establishing correspondences among object instances is still challenging in multi-camera surveillance systems, especially when the cameras’ fields of view are non-overlapping. Spatiotemporal constraints can help in solving ...
  • Object Oriented Animation on the World Wide Web
    Cai, Patrick P.; Bestavros, Azer (Boston University Computer Science Department, 1995-07-18)
    This report describes our attempt to add animation as another data type to be used on the World Wide Web. Our current network infrastructure, the Internet, is incapable of carrying video and audio streams for them to be ...
  • Object Recognition and Localization via Spatial Instance Embedding
    Ikizler-Cinbis, Nazli; Sclaroff, Stan (CS Department, Boston University, 2010-07-06)
    We propose an approach for improving object recognition and localization using spatial kernels together with instance embedding. Our approach treats each image as a bag of instances (image features) within a multiple ...
  • Object, Scene and Actions
    Ikizler-Cinbis, Nazli; Sclaroff, Stan (CS Department, Boston University, 2010-07-06)
    In many cases, human actions can be identified not only by the singular observation of the human body in motion, but also properties of the surrounding scene and the related objects. In this paper, we look into this problem ...
  • An Omniscient Scheduling Oracle for Systems with Harmonic Periods
    Atlas, Alia; Bestavros, Azer (Boston University Computer Science Department, 1998-09-02)
    Most real-time scheduling problems are known to be NP-complete. To enable accurate comparison between the schedules of heuristic algorithms and the optimal schedule, we introduce an omniscient oracle. This oracle provides ...
  • On Class-based Isolation of UDP, Short-lived and Long-lived TCP Flows
    Yilmaz, Selma; Matta, Ibrahim (Boston University Computer Science Department, 2001)
    The congestion control mechanisms of TCP make it vulnerable in an environment where flows with different congestion-sensitivity compete for scarce resources. With the increasing amount of unresponsive UDP traffic in today's ...
  • On Clustering Images Using Compression
    Hescott, Benjamin; Koulomzin, Daniel (Boston University Computer Science Department, 2006-02-22)
    The need for the ability to cluster unknown data to better understand its relationship to know data is prevalent throughout science. Besides a better understanding of the data itself or learning about a new unknown object, ...

Search OpenBU


Advanced Search

Browse

Deposit Materials