Sciweavers

786 search results - page 50 / 158
» An Efficient k-Means Clustering Algorithm: Analysis and Impl...
Sort
View
ALGORITHMICA
2002
83views more  ALGORITHMICA 2002»
13 years 8 months ago
A Tutorial for Designing Flexible Geometric Algorithms
The implementation of an algorithm is faced with the issues efficiency, flexibility, and ease-of-use. In this paper, we suggest a design concept that greatly increases the flexibi...
Vikas Kapoor, Dietmar Kühl, Alexander Wolff
IJCAI
1989
13 years 9 months ago
Formal Properties and Implementation of Bidirectional Charts
Several theories of grammar currently converge toward inserting subcategorization information within lexical entries. Such a tendency would benefit from a parsing algorithm able t...
Giorgio Satta, Oliviero Stock
OSDI
2008
ACM
14 years 8 months ago
Hunting for Problems with Artemis
Artemis is a modular application designed for analyzing and troubleshooting the performance of large clusters running datacenter services. Artemis is composed of four modules: (1)...
Gabriela F. Cretu-Ciocarlie, Mihai Budiu, Mois&eac...
ICISC
2004
169views Cryptology» more  ICISC 2004»
13 years 9 months ago
ADWICE - Anomaly Detection with Real-Time Incremental Clustering
Abstract. Anomaly detection, detection of deviations from what is considered normal, is an important complement to misuse detection based on attack signatures. Anomaly detection in...
Kalle Burbeck, Simin Nadjm-Tehrani
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
14 years 1 months ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...