807 search results - page 44 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
162
click to vote
SODA
1990
ACM
15 years 5 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
146
click to vote
VLDB
1999
ACM
15 years 8 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
140
click to vote
ISM
2006
IEEE
15 years 4 months ago
2006
IEEE
A novel indexing and access method, called Affinity Hybrid Tree (AH-Tree), is proposed to organize large image data sets efficiently and to support popular image access mechanisms...
139
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...
263
click to vote
ESA
2011
Springer
14 years 3 months ago
2011
Springer
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...