20 search results - page 4 / 4 » Contracted Suffix Trees: A Simple and Dynamic Text Indexing ... |
ICUIMC
2009
ACM
13 years 11 months ago
2009
ACM
Although documents have hundreds of thousands of unique words, only a small number of words are significantly useful for intelligent services. For this reason, feature extraction ...
NECO
2006
13 years 5 months ago
2006
Recently, there has been an outburst of interest in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, at present, ...
ICNC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Recently, there has been an outburst of interest in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. The represen...
OOPSLA
2005
Springer
13 years 10 months ago
2005
Springer
Representing programs as text strings makes programming harder then it has to be. The source text of a program is far removed from its behavior. Bridging this conceptual gulf is w...
HICSS
2002
IEEE
13 years 10 months ago
2002
IEEE
Abstract— Recent advances in graph-based search techniques derived from Kleinberg’s work [1] have been impressive. This paper further improves the graph-based search algorithm ...