Browsing CAS: Computer Science: Technical Reports by Author "Papapetrou, Panagiotis"

OpenBU

Browsing CAS: Computer Science: Technical Reports by Author "Papapetrou, Panagiotis"

Sort by: Order: Results:

  • Papapetrou, Panagiotis (Boston University Computer Science Department, 2006-12-30)
    The problem of discovering frequent arrangements of temporal intervals is studied. It is assumed that the database consists of sequences of events, where an event occurs during a time-interval. The goal is to mine temporal ...
  • Papapetrou, Panagiotis; Benson, Gary; Kollios, George (Boston University Computer Science Department, 2006-10-15)
    The problem of discovering frequent arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence is studied, and two efficient approaches are proposed to solve it. The first approach ...
  • Papapetrou, Panagiotis; Benson, Gary; Kollios, George (Boston University Computer Science Department, 2008-10-21)
    The problem of discovering frequent poly-regions (i.e. regions of high occurrence of a set of items or patterns of a given alphabet) in a sequence is studied, and three efficient approaches are proposed to solve it. The ...

Search OpenBU


Advanced Search

Browse

Deposit Materials