75 search results - page 5 / 15 » Optimal Suffix Tree Construction with Large Alphabets |
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
ISSAC
1994
Springer
14 years 20 days ago
1994
Springer
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
IUI
2009
ACM
14 years 5 months ago
2009
ACM
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
ISCC
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract Content Delivery Networks (CDNs) provide an efficient support for serving http and streaming media content while minimizing the network impact of content delivery as well...
BIBM
2010
IEEE
13 years 6 months ago
2010
IEEE
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...