256 search results - page 30 / 52 » A practical comparison of two K-Means clustering algorithms |
85
Voted
ECML
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. A combinatorial random variable is a discrete random variable defined over a combinatorial set (e.g., a power set of a given set). In this paper we introduce combinatoria...
SDM
2010
SIAM
14 years 11 months ago
2010
SIAM
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
117
click to vote
BMCBI
2006
14 years 9 months ago
2006
Background: The learning of global genetic regulatory networks from expression data is a severely under-constrained problem that is aided by reducing the dimensionality of the sea...
91
Voted
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...