Sciweavers

616 search results - page 68 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
BMCBI
2005
147views more  BMCBI 2005»
13 years 7 months ago
Calibration of mass spectrometric peptide mass fingerprint data without specific external or internal calibrants
Background: Peptide Mass Fingerprinting (PMF) is a widely used mass spectrometry (MS) method of analysis of proteins and peptides. It relies on the comparison between experimental...
Witold E. Wolski, Maciej Lalowski, Peter Jungblut,...
GD
2004
Springer
14 years 1 months ago
Clustering Cycles into Cycles of Clusters
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
Pier Francesco Cortese, Giuseppe Di Battista, Maur...
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 1 months ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
14 years 2 months ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....
FSTTCS
2005
Springer
14 years 1 months ago
Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems
Monitoring a distributed system to detect a stable property is an important problem with many applications. The problem is especially challenging for a dynamic distributed system b...
Sathya Peri, Neeraj Mittal