Sciweavers

429 search results - page 71 / 86
» Free Parallel Data Mining
Sort
View
KDD
2002
ACM
147views Data Mining» more  KDD 2002»
15 years 10 months ago
Visualized Classification of Multiple Sample Types
The goal of the knowledge discovery and data mining is to extract the useful knowledge from the given data. Visualization enables us to find structures, features, patterns, and re...
Li Zhang, Aidong Zhang, Murali Ramanathan
EUROPAR
2009
Springer
15 years 4 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
HPCC
2007
Springer
15 years 4 months ago
Adaptive Computation of Self Sorting In-Place FFTs on Hierarchical Memory Architectures
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
ICDM
2009
IEEE
223views Data Mining» more  ICDM 2009»
15 years 4 months ago
Execution Anomaly Detection in Distributed Systems through Unstructured Log Analysis
Abstract -- Detection of execution anomalies is very important for the maintenance, development, and performance refinement of large scale distributed systems. Execution anomalies ...
Qiang Fu, Jian-Guang Lou, Yi Wang, Jiang Li
FCT
1991
Springer
15 years 1 months ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini