5595 search results - page 807 / 1119 » Approximation Algorithms for Clustering Problems |
215
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
178
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
212
click to vote
TCBB
2008
15 years 6 months ago
2008
It is a consensus in microarray analysis that identifying potential local patterns, characterized by coherent groups of genes and conditions, may shed light on the discovery of pre...
169
click to vote
WABI
2009
Springer
16 years 1 months ago
2009
Springer
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
226
click to vote
DATAMINE
2006
15 years 6 months ago
2006
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...