Browsing Computer Science by Title

OpenBU

Browsing Computer Science by Title

Sort by: Order: Results:

  • Face Identification by a Cascade of Rejection Classifiers
    Yuan, Quan; Thangali, Ashwin; Sclaroff, Stan (Boston University Computer Science Department, 2005-06-10)
    Nearest neighbor search is commonly employed in face recognition but it does not scale well to large dataset sizes. A strategy to combine rejection classifiers into a cascade for face identification is proposed in this ...
  • Facial Feature Tracking and Occlusion Recovery in American Sign Language
    Castelli, Thomas J.; Betke, Margrit; Neidle, Carol (Boston University Computer Science Department, 2005-07-07)
    Facial features play an important role in expressing grammatical information in signed languages, including American Sign Language(ASL). Gestures such as raising or furrowing the eyebrows are key indicators of constructions ...
  • Faithful Translations between Polyvariant Flows and Polymorphic Types
    Amtoft, Torben; Turbak, Franklyn (Boston University Computer Science Department, 2000-01-10)
    Recent work has shown equivalences between various type systems and flow logics. Ideally, the translations upon which such equivalences are based should be faithful in the sense that information is not lost in round-trip ...
  • Fast Approximate Reconciliation of Set Differences
    Byers, John; Considine, Jeffrey; Mitzenmacher, Michael (Boston University Computer Science Department, 2002)
    We present new, simple, efficient data structures for approximate reconciliation of set differences, a useful standalone primitive for peer-to-peer networks and a natural subroutine in methods for exact reconciliation. In ...
  • Fast Globally Optimal 2D Human Detection with Loopy Graph Models
    Tian, Tai-Peng; Sclaroff, Stan (CS Department, Boston University, 2010-03-31)
    This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time complexity scales exponentially in the size of ...
  • Fast Head Tilt Detection for Human-Computer Interaction
    Waber, Benjamin N.; Magee, John J.; Betke, Margrit (Boston University Computer Science Department, 2005-07-07)
    Accurate head tilt detection has a large potential to aid people with disabilities in the use of human-computer interfaces and provide universal access to communication software. We show how it can be utilized to tab through ...
  • Fast, Reliable Head Tracking under Varying Illumination
    La Casica, Marco; Sclaroff, Stan (Boston University Computer Science Department, 1998-12-04)
    An improved technique for 3D head tracking under varying illumination conditions is proposed. The head is modeled as a texture mapped cylinder. Tracking is formulated as an image registration problem in the cylinder's ...
  • Fast, Reliable Head Tracking under Varying Illumination: An Approach Based on Registration of Texture-Mapped 3D Model
    La Casica, Marco; Sclaroff, Stan; Athitsos, Vassilis (Boston University Computer Science Department, )
    An improved technique for 3D head tracking under varying illumination conditions is proposed. The head is modeled as a texture mapped cylinder. Tracking is formulated as an image registration problem in the cylinder's ...
  • Fast Shortest Path Distance Estimation in Large Networks
    Potamias, Michalis; Castillo, Carlos; Francesco, Bonchi; Gionis, Aristides (Boston University Computer Science Department, 2009-03-09)
    We study the problem of preprocessing a large graph so that point-to-point shortest-path queries can be answered very fast. Computing shortest paths is a well studied problem, but exact algorithms do not scale to huge ...
  • Finding Local Communities in Protein Networks
    Voevodski, Konstantin; Teng, Shang-Hua; Xia, Yu (BioMed Central, 2009-9-18)
    BACKGROUND. Protein-protein interactions (PPIs) play fundamental roles in nearly all biological processes, and provide major insights into the inner workings of cells. A vast amount of PPI data for various organisms is ...
  • Fine-Grained Layered Multicast
    Byers, John; Luby, Michael; Mitzenmacher, Michael (Boston University Computer Science Department, 2000-12-15)
    Traditional approaches to receiver-driven layered multicast have advocated the benefits of cumulative layering, which can enable coarse-grained congestion control that complies with TCP-friendliness equations over large ...
  • Fixed Point vs. First-Order Logic on Finite Ordered Structures with Unary Relations
    Kfoury, A.J.; Wymann-Böni, M. (Boston University Computer Science Department, 1993-08-11)
    We prove that first order logic is strictly weaker than fixed point logic over every infinite classes of finite ordered structures with unary relations: Over these classes there is always an inductive unary relation which ...
  • Foreground Object Segmentation from Binocular Stereo Video
    Law, Kevin; Sclaroff, Stan (Boston University Computer Science Department, 2005-05-19)
    Moving cameras are needed for a wide range of applications in robotics, vehicle systems, surveillance, etc. However, many foreground object segmentation methods reported in the literature are unsuitable for such settings; ...
  • Forewarding in Mobile Opportunistic Networks
    Erramilli, Vijay (Boston University Computer Science Department, 2009)
    Recent advances in processor speeds, mobile communications and battery life have enabled computers to evolve from completely wired to completely mobile. In the most extreme case, all nodes are mobile and communication takes ...
  • A Formal Semantics for Weak References
    Hallet, J. J.; Kfoury, A. J. (Boston University Computer Science Department, 2005-08-08)
    A weak reference is a reference to an object that is not followed by the pointer tracer when garbage collection is called. That is, a weak reference cannot prevent the object it references from being garbage collected. ...
  • Formal Verification of SLA Transformations
    Ishakian, Vatche; Lapets, Andrei; Bestavros, Azer; Kfoury, Assaf (CS Department, Boston University, 2010-08-24)
    Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for unencumbered use by the application. ...
  • Foundational Theory for Understanding Policy Routing Dynamics
    Mattar, Karim; Epstein, Samuel; Matta, Ibrahim (Boston University Computer Science Department, 2009-01-30)
    In this paper we introduce a theory of policy routing dynamics based on fundamental axioms of routing update mechanisms. We develop a dynamic policy routing model (DPR) that extends the static formalism of the stable paths ...
  • A Framework for Local Anonymity in the Internet
    Martin, David M. (Boston University Computer Science Department, 1998-02-21)
    We describe and evaluate options for providing anonymous IP service, argue for the further investigation of local anonymity, and sketch a framework for the implementation of locally anonymous networks.
  • Friendly Virtual Machine: Leveraging a Feedback-Control Model for Application Adaptation
    Zhang, Yuting; Bestavros, Azer; Guirguis, Mina; Matta, Ibrahim; West, Richard (Boston University Computer Science Department, 2004-07-19)
    With the increased use of "Virtual Machines" (VMs) as vehicles that isolate applications running on the same host, it is necessary to devise techniques that enable multiple VMs to share underlying resources both fairly and ...
  • A Fully Distributed Location Management Scheme for Large PCS
    Ratnam, Karunaharan; Matta, Ibrahim; Rangarajan, Sampath (Boston University Computer Science Department, 1999-08-24)
    In [previous papers] we presented the design, specification and proof of correctness of a fully distributed location management scheme for PCS networks and argued that fully replicating location information is both appropriate ...

Search OpenBU


Advanced Search

Browse

Deposit Materials