4541 search results - page 107 / 909 » Cache-Oblivious Algorithms and Data Structures |
DATAMINE
1999
14 years 11 months ago
1999
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
ICANN
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. The paper presents a new version of a GMDH type algorithm able to perform an automatic model structure synthesis, robust model parameter estimation and model validation i...
110
click to vote
AUTOMATICA
2008
14 years 11 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
IFIP
2004
Springer
15 years 4 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
ICPR
2006
IEEE
16 years 9 days ago
2006
IEEE
In this paper, we describe the method for aligning multiple range images given by a range finder. Especially we will use range images of inside and outside of buildings which cont...