Sciweavers

2034 search results - page 83 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
FSTTCS
2001
Springer
14 years 14 days ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
SOCO
2008
Springer
13 years 7 months ago
A particular Gaussian mixture model for clustering and its application to image retrieval
We introduce a new method for data clustering based on a particular Gaussian mixture model (GMM). Each cluster of data, modeled as a GMM into an input space, is interpreted as a hy...
Hichem Sahbi
CLUSTER
2003
IEEE
14 years 1 months ago
A Cluster-Based Solution for High Performance Hmmpfam Using EARTH Execution Model
Hmmpfam is a widely used computation-intensive bioinformatics software for sequence classification. The contribution of this paper is the first largely scalable and robust clust...
Weirong Zhu, Yanwei Niu, Jizhu Lu, Chuan Shen, Gua...
AES
2000
Springer
98views Cryptology» more  AES 2000»
14 years 9 days ago
How Well Are High-End DSPs Suited for the AES Algorithms? AES Algorithms on the TMS320C6x DSP
The National Institute of Standards and Technology (NIST) has announced that one of the design criteria for the Advanced Encryption Standard (AES) algorithm was the ability to e...
Thomas J. Wollinger, Min Wang, Jorge Guajardo, Chr...
CPM
2004
Springer
108views Combinatorics» more  CPM 2004»
14 years 1 months ago
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
Thomas Schmidt, Jens Stoye