112 search results - page 12 / 23 » An Approximation Algorithm for Alphabet Indexing Problem |
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
WWW
2005
ACM
16 years 9 days ago
2005
ACM
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
KDD
2004
ACM
16 years 1 days ago
2004
ACM
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
107
click to vote
DASFAA
2003
IEEE
15 years 5 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
ALGORITHMICA
1999
14 years 11 months ago
1999
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...