387 search results - page 55 / 78 » Many Random Walks Are Faster Than One |
KDD
2009
ACM
14 years 9 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
SBCCI
2003
ACM
14 years 2 months ago
2003
ACM
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
LISP
2007
13 years 9 months ago
2007
Krivine presents the K machine, which produces weak head normal form results. Sestoft introduces several call-by-need variants of the K machine that implement result sharing via pu...
SAMOS
2004
Springer
14 years 2 months ago
2004
Springer
This paper presents a model for instruction-level distributed computing that allows the implementation of scalable chip multiprocessors. Based on explicit microthreading it serves ...
BMCBI
2011
13 years 4 months ago
2011
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...