124 search results - page 3 / 25 » The Cell Probe Complexity of Succinct Data Structures |
STACS
2009
Springer
14 years 1 days ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
BMCBI
2005
13 years 5 months ago
2005
Background: Taxon specific hybridization probes in combination with a variety of commonly used hybridization formats nowadays are standard tools in microbial identification. A fre...
ICANN
2010
Springer
13 years 5 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...