Sciweavers

169 search results - page 20 / 34
» Pattern Matching in Text Compressed by Using Antidictionarie...
Sort
View
ALMOB
2006
102views more  ALMOB 2006»
13 years 7 months ago
Mining, compressing and classifying with extensible motifs
Background: Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have recently proven a valuable notion also in t...
Alberto Apostolico, Matteo Comin, Laxmi Parida
SCOPES
2004
Springer
14 years 25 days ago
Instruction Selection for Compilers that Target Architectures with Echo Instructions
Echo Instructions have recently been introduced to allow embedded processors to provide runtime decompression of LZ77-compressed programs at a minimal hardware cost compared to oth...
Philip Brisk, Ani Nahapetian, Majid Sarrafzadeh
CIKM
2000
Springer
13 years 12 months ago
Retrieving Descriptive Phrases from Large Amounts of Free Text
This paper presents a system that retrieves descriptive phrases of proper nouns from free text. Sentences holding the specified noun are ranked using a technique based on pattern ...
Hideo Joho, Mark Sanderson
NLDB
2007
Springer
14 years 1 months ago
Large-Scale Knowledge Acquisition from Botanical Texts
Free text botanical descriptions contained in printed floras can provide a wealth of valuable scientific information. In spite of this richness, these texts have seldom been anal...
François Role, Milagros Fernandez Gavilanes...
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
13 years 9 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha