773 search results - page 18 / 155 » Suffix Trees on Words |
171
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
182
click to vote
CSB
2002
IEEE
15 years 11 months ago
2002
IEEE
-- We investigate off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform (BWT). The preponderance of short repeating patterns i...
298
click to vote
FCCM
2011
IEEE
14 years 10 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
165
click to vote
COLING
2008
15 years 8 months ago
2008
We propose a supervised word sense disambiguation (WSD) method using tree-structured conditional random fields (TCRFs). By applying TCRFs to a sentence described as a dependency t...
148
click to vote
COLING
1996
15 years 8 months ago
1996
One of the problems in part-of-speech tagging of real-word texts is that of unknown to the lexicon words. In (Mikheev, 1996), a technique for fully unsupervised statistical acquis...