11394 search results - page 475 / 2279 » Error-Correcting Data Structures |
185
Voted
DASFAA
2003
IEEE
15 years 11 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...
191
click to vote
DATESO
2009
15 years 4 months ago
2009
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
161
Voted
SODA
2010
ACM
16 years 3 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...
184
click to vote
FTDB
2008
15 years 6 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...
165
click to vote
ICDM
2008
IEEE
16 years 24 days 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...