1541 search results - page 213 / 309 » Analysis of Random Noise and Random Walk Algorithms |
SIGMOD
1998
ACM
14 years 12 days ago
1998
ACM
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
VLDB
1994
ACM
14 years 7 days ago
1994
ACM
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. In this paper, we explore whether clustering ...
CC
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
WSC
2007
13 years 10 months ago
2007
Models of real world systems are being increasingly generated from data that describes the behaviour of systems. Data mining techniques, such as Artificial Neural Networks (ANN),...