Sciweavers

1284 search results - page 159 / 257
» Data Structures for Mergeable Trees
Sort
View
DOCENG
2005
ACM
15 years 4 months ago
Enhancing composite digital documents using XML-based standoff markup
Document representations can rapidly become unwieldy if they try to encapsulate all possible document properties, ranging tract structure to detailed rendering and layout. We pres...
Peter L. Thomas, David F. Brailsford
AC
2003
Springer
15 years 7 months ago
Generic Haskell: Applications
Generic Haskell is an extension of Haskell that supports the construction of generic programs. These lecture notes discuss three advanced generic programming applications: generic ...
Ralf Hinze, Johan Jeuring
ACMSE
2008
ACM
15 years 4 months ago
Mining frequent sequential patterns with first-occurrence forests
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers...
Erich Allen Peterson, Peiyi Tang
137
Voted
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
15 years 6 months ago
FSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
Steffen Kempe, Jochen Hipp, Rudolf Kruse
203
Voted
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
16 years 2 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande