688 search results - page 84 / 138 » General Partitioning on Random Graphs |
145
click to vote
JCB
2002
15 years 6 days ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
107
Voted
KDD
2004
ACM
16 years 28 days ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
111
click to vote
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
Parallel random access memory, or PRAM, is a now venerable model of parallel computation that that still retains its usefulness for the design and analysis of parallel algorithms....
112
click to vote
CORR
2008
Springer
15 years 18 days ago
2008
Springer
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...
86
Voted
RECOMB
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...