675 search results - page 118 / 135 » Biased Range Trees |
181
click to vote
FCCM
2011
IEEE
14 years 2 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...
103
Voted
CCP
2011
13 years 10 months ago
2011
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
113
click to vote
EUROPAR
2011
Springer
13 years 10 months ago
2011
Springer
Most applications manipulate structured data. Modern languages and platforms provide collection frameworks with basic data structures like lists, hashtables and trees. These data ...
ACL
2012
13 years 1 months ago
2012
We propose a simple generative, syntactic language model that conditions on overlapping windows of tree context (or treelets) in the same way that n-gram language models condition...
287
click to vote
ICDE
2003
IEEE
16 years 6 days ago
2003
IEEE
Analyzing sequence data has become increasingly important recently in the area of biological sequences, text documents, web access logs, etc. In this paper, we investigate the pro...