Sciweavers

1952 search results - page 186 / 391
» Complete partitions of graphs
Sort
View
DBA
2004
113views Database» more  DBA 2004»
15 years 8 months ago
A Quality Measure for Distributed Clustering
Clustering has become an increasingly important task in modern application domains. Mostly, the data are originally collected at different sites. In order to extract information f...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle
INFORMATICALT
2010
118views more  INFORMATICALT 2010»
15 years 3 months ago
Facilitating Ontology Development with Continuous Evaluation
In this paper we propose facilitating ontology development by constant evaluation of steps in the process of ontology development. Existing methodologies for ontology development a...
Dejan Lavbic, Marjan Krisper
ICML
2007
IEEE
16 years 7 months ago
Relational clustering by symmetric convex coding
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
16 years 7 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
IEEEPACT
2009
IEEE
16 years 1 months ago
Anaphase: A Fine-Grain Thread Decomposition Scheme for Speculative Multithreading
Industry is moving towards multi-core designs as we have hit the memory and power walls. Multi-core designs are very effective to exploit thread-level parallelism (TLP) but do not...
Carlos Madriles, Pedro López, Josep M. Codi...