Sciweavers

521 search results - page 58 / 105
» Coring method for clustering a graph
Sort
View
RECOMB
2007
Springer
16 years 4 months ago
An Efficient and Accurate Graph-Based Approach to Detect Population Substructure
Currently, large-scale projects are underway to perform whole genome disease association studies. Such studies involve the genotyping of hundreds of thousands of SNP markers. One o...
Srinath Sridhar, Satish Rao, Eran Halperin
BMCBI
2010
139views more  BMCBI 2010»
15 years 4 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler
182
Voted
ICDM
2010
IEEE
232views Data Mining» more  ICDM 2010»
15 years 1 months ago
gSkeletonClu: Density-Based Network Clustering via Structure-Connected Tree Division or Agglomeration
Community detection is an important task for mining the structure and function of complex networks. Many pervious approaches are difficult to detect communities with arbitrary size...
Heli Sun, Jianbin Huang, Jiawei Han, Hongbo Deng, ...
SOSP
2009
ACM
16 years 1 months ago
Distributed aggregation for data-parallel computing: interfaces and implementations
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
Yuan Yu, Pradeep Kumar Gunda, Michael Isard
ICIAP
2003
ACM
15 years 9 months ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar