2745 search results - page 211 / 549 » A fast algorithm for computing large Fibonacci numbers |
121
click to vote
ICA
2007
Springer
15 years 10 months ago
2007
Springer
Blind source extraction (BSE) is of advantages over blind source separation (BSS) when obtaining some underlying source signals from high dimensional observed signals. Among a vari...
134
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...
180
click to vote
ICPP
2000
IEEE
15 years 8 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
119
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
138
click to vote
CIS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. As a novel research direction, privacy-preserving data mining (PPDM) has received a great deal of attentions from more and more researchers, and a large number of PPDM al...