Sciweavers

CPM
2006
Springer
114views Combinatorics» more  CPM 2006»
15 years 7 months ago
A Simpler Analysis of Burrows-Wheeler Based Compression
Haim Kaplan, Shir Landau, Elad Verbin
FQAS
2004
Springer
146views Database» more  FQAS 2004»
15 years 7 months ago
Discovering Representative Models in Large Time Series Databases
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
Simona E. Rombo, Giorgio Terracina
CPM
2006
Springer
143views Combinatorics» more  CPM 2006»
15 years 7 months ago
Algorithms for Finding a Most Similar Subforest
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
Jesper Jansson, Zeshan Peng
CPM
2006
Springer
140views Combinatorics» more  CPM 2006»
15 years 7 months ago
Identifying Co-referential Names Across Large Corpora
A single logical entity can be referred to by several different names over a large text corpus. We present our algorithm for finding all suchco-reference sets in a large corpus. Ou...
Levon Lloyd, Andrew Mehler, Steven Skiena
CPM
2006
Springer
137views Combinatorics» more  CPM 2006»
15 years 7 months ago
Large Scale Matching for Position Weight Matrices
Aude Liefooghe, Hélène Touzet, Jean-...