Sciweavers

641 search results - page 38 / 129
» Collusion set detection using graph clustering
Sort
View
CANDC
2006
ACM
13 years 8 months ago
Detecting and aligning peaks in mass spectrometry data with applications to MALDI
In this paper, we address the peak detection and alignment problem in the analysis of mass spectrometry data. To deal with the peak redundancy problem existing in the MALDI data a...
Weichuan Yu, Baolin Wu, Ning Lin, Kathy Stone, Ken...
IJCV
2007
115views more  IJCV 2007»
13 years 8 months ago
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
Andrea Torsello, Antonio Robles-Kelly, Edwin R. Ha...
BMCBI
2007
149views more  BMCBI 2007»
13 years 8 months ago
Novel and simple transformation algorithm for combining microarray data sets
Background: With microarray technology, variability in experimental environments such as RNA sources, microarray production, or the use of different platforms, can cause bias. Suc...
Ki-Yeol Kim, Dong Hyuk Ki, Ha Jin Jeong, Hei-Cheul...
ICASSP
2010
IEEE
13 years 8 months ago
Bridge detection and robust geodesics estimation via random walks
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...
Eugene Brevdo, Peter J. Ramadge
MST
2010
98views more  MST 2010»
13 years 7 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...