11219 search results - page 462 / 2244 » Retroactive data structures |
265
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
216
Voted
DASFAA
2003
IEEE
16 years 1 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...
200
click to vote
SODA
2010
ACM
16 years 5 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
221
click to vote
FTDB
2008
15 years 7 months ago
2008
The automatic extraction of information from unstructured sources has opened up new avenues for querying, organizing, and analyzing data by drawing upon the clean semantics of str...
203
click to vote
ICDM
2008
IEEE
16 years 2 months ago
2008
IEEE
Many data sets are incomplete. For correct analysis of such data, one can either use algorithms that are designed to handle missing data or use imputation. Imputation has the bene...