Sciweavers

587 search results - page 45 / 118
» New Algorithms for Text Fingerprinting
Sort
View
COCOON
2006
Springer
15 years 1 months ago
Finding Patterns with Variable Length Gaps or Don't Cares
In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gap...
M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, ...
SOFSEM
2007
Springer
15 years 3 months ago
Indexing Factors with Gaps
Indexing of factors is a widely used and useful technique in stringology and can be seen as a tool in solving diverse text algorithmic problems. A gapped-factor is a concatenation ...
M. Sohel Rahman, Costas S. Iliopoulos
NAACL
2010
14 years 7 months ago
Multi-document Summarization via Budgeted Maximization of Submodular Functions
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
Hui Lin, Jeff Bilmes
KDD
2008
ACM
121views Data Mining» more  KDD 2008»
15 years 10 months ago
Mining multi-faceted overviews of arbitrary topics in a text collection
A common task in many text mining applications is to generate a multi-faceted overview of a topic in a text collection. Such an overview not only directly serves as an informative...
Xu Ling, Qiaozhu Mei, ChengXiang Zhai, Bruce R. Sc...
ECAI
2010
Springer
14 years 10 months ago
Learning to Author Text with textual CBR
Abstract. Textual reuse is an integral part of textual case-based reasoning (TCBR) which deals with solving new problems by reusing previous similar problem-solving experiences doc...
Ibrahim Adeyanju, Nirmalie Wiratunga, Juan A. Reci...