OpenBU

Browsing Computer Science by Title

OpenBU

Browsing Computer Science by Title

Sort by: Order: Results:

  • Vasconcelos, Marisa; Crovella, Mark (Boston University Computer Science Department, 2008-09-11)
    Localization is essential feature for many mobile wireless applications. Data collected from applications such as environmental monitoring, package tracking or position tracking has no meaning without knowing the location ...
  • Buzan, Dan; Sclaroff, Stan; Kollios, George (Boston University Computer Science Department, 2004-04-23)
    A system is described that tracks moving objects in a video dataset so as to extract a representation of the objects' 3D trajectories. The system then finds hierarchical clusters of similar trajectories in the video dataset. ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Bestavros, Azer; Erdos, Dora; Ishakian, Vatche; Lapets, Andrei; Terzi, Evimaria (Computer Science Department, Boston University, 2011-02-21)
    In many information networks, data items such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route updates in ad-hoc networks, etc. propagate in ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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; ...
  • 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 ...
  • 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. ...
  • Reynolds, Mark; Bestavros, Azer (Computer Science Department, Boston University, 2011-12-30)
    In assigning access permissions to users, formal policies fill a key role in mapping access from user attributes to resources. In a single domain a policy should be both sound (no false positives) and also complete (no ...
  • 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. ...

Search OpenBU


Browse

Deposit Materials

Statistics