Browsing Computer Science by Author "Epstein, Samuel"

OpenBU

Browsing Computer Science by Author "Epstein, Samuel"

Sort by: Order: Results:

  • Epstein, Samuel; Betke, Margrit (Boston University Computer Science Department, 2009-03-10)
    We introduce Active Hidden Models (AHM) that utilize kernel methods traditionally associated with classification. We use AHMs to track deformable objects in video sequences by leveraging kernel projections. We introduce ...
  • Magee, John; Epstein, Samuel; Missimer, Eric; Betke, Margrit (CS Department, Boston University, 2010-09-06)
    Users of mouse-replacement interfaces may have difficulty conforming to the motion requirements of their interfacesystem. We have observed users with severe motor disabilities who controlled the mouse pointer with a head ...
  • Missimer, Eric; Epstein, Samuel; Magee, John; Betke, Margrit (CS Department, Boston University, 2010-08-12)
    Customizable Keyboard is an on-screen keyboard designed to be flexible and expandable. Instead of giving the user a keyboard layout Customizable Keyboard allows the user to create a layout that is accommodating to the ...
  • 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 ...
  • Epstein, Samuel; Matta, Ibrahim; Mattar, Karim (Boston University Computer Science Department, 2008-08-15)
    We present an online distributed algorithm, the Causation Logging Algorithm (CLA), in which Autonomous Systems (ASes) in the Internet individually report route oscillations/flaps they experience to a central Internet Routing ...
  • Mattar, Karim; Epstein, Samuel; Matta, Ibrahim (CS Department, Boston University, 2010-04-27)
    The dynamic policy routing model (DPR) was recently introduced to explicitly model the dynamics of policy routing. DPR extends the formalism of the stable paths problem with discrete synchronous time to capture the propagation ...
  • Epstein, Samuel; Mattar, Karim; Matta, Ibrahim (Boston University Computer Science Department, 2009-04-21)
    We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the notion of causation chains where the route flap ...

Search OpenBU


Advanced Search

Browse

Deposit Materials