2570 search results - page 5 / 514 » Fast Algorithms For The Computation Of Ranklets |
DATAMINE
1999
13 years 8 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,...
ICASSP
2011
IEEE
13 years 7 days ago
2011
IEEE
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...
ICASSP
2011
IEEE
13 years 7 days ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
MOC
2002
13 years 8 months ago
2002
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
JUCS
2002
13 years 8 months ago
2002
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...