27 search results - page 3 / 6 » Subspace Discovery for Promotion: A Cell Clustering Approach |
CVPR
2010
IEEE
13 years 9 months ago
2010
IEEE
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
CORR
1999
Springer
13 years 5 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
ICDM
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract--We propose a framework for discovery of collaborative community structure in Wiki-based knowledge repositories based on raw-content generation analysis. We leverage topic...
BMCBI
2006
13 years 5 months ago
2006
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
BMCBI
2006
13 years 5 months ago
2006
Background: One type of DNA microarray experiment is discovery of gene expression patterns for a cell line undergoing a biological process over a series of time points. Two import...