Sciweavers

4816 search results - page 172 / 964
» Performance analysis of the AntNet algorithm
Sort
View
HIPC
1999
Springer
15 years 10 months ago
High Performance Data Mining
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven ...
Vipin Kumar, Jaideep Srivastava
IBPRIA
2003
Springer
15 years 11 months ago
Hash-Like Fractal Image Compression with Linear Execution Time
The main computational cost in Fractal Image Analysis (FIC) comes from the required range-domain full block comparisons. In this work we propose a new algorithm for this comparison...
Kostadin Koroutchev, José R. Dorronsoro
KDD
2004
ACM
103views Data Mining» more  KDD 2004»
16 years 6 months ago
An objective evaluation criterion for clustering
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...
Arindam Banerjee, John Langford
MM
2004
ACM
248views Multimedia» more  MM 2004»
15 years 11 months ago
Incremental semi-supervised subspace learning for image retrieval
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
Xiaofei He
SCAM
2007
IEEE
16 years 17 days ago
Extending Attribute Grammars with Collection Attributes--Evaluation and Applications
Collection attributes, as defined by Boyland, can be used as a mechanism for concisely specifying cross-referencelike properties such as callee sets, subclass sets, and sets of v...
Eva Magnusson, Torbjörn Ekman, Görel Hed...