49 search results - page 4 / 10 » Augmenting Suffix Trees, with Applications |
FCCM
2011
IEEE
12 years 11 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...
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
STACS
1992
Springer
13 years 11 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
ISMAR
2005
IEEE
14 years 1 months ago
2005
IEEE
Mixed Reality applications put very high demands on both the visual realism and the rendering times of computer graphics elements that are to be perceived as part of the physical ...
DASFAA
2005
IEEE
14 years 1 months ago
2005
IEEE
Naive Bayes has been widely used in data mining as a simple and effective classification algorithm. Since its conditional independence assumption is rarely true, numerous algorit...