308 search results - page 4 / 62 » How Fast Is the k-Means Method |
KDD
2012
ACM
12 years 1 months ago
2012
ACM
Given huge collections of time-evolving events such as web-click logs, which consist of multiple attributes (e.g., URL, userID, timestamp), how do we find patterns and trends? Ho...
USENIX
2003
14 years 6 days ago
2003
We present an in-kernel disk prefetcher which uses speculative execution to determine what data an application is likely to require in the near future. By placing our design withi...
ICA
2012
Springer
12 years 6 months ago
2012
Springer
Independent component analysis (ICA) is possibly the most widespread approach to solve the blind source separation (BSS) problem. Many different algorithms have been proposed, tog...
SAGT
2010
Springer
13 years 9 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
ICDM
2010
IEEE
13 years 8 months ago
2010
IEEE
A large number of data mining methods are, as such, not applicable to fast, intuitive, and interactive use. Thus, there is a need for visually controllable data mining methods. Suc...