176 search results - page 23 / 36 » A Clustering Approach to Solving Large Stochastic Matching P... |
CSB
2003
IEEE
14 years 1 months ago
2003
IEEE
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
CMA
2010
13 years 6 months ago
2010
Abstract. Previous work [51] showed how to solve time-fractional diffusion equations by particle tracking. This paper extends the method to the case where the order of the fraction...
ASPDAC
1999
ACM
14 years 28 days ago
1999
ACM
We present a novel formulation, called the WaMPDE, for solving systems with forced autonomous components. An important feature of the WaMPDE is its ability to capture frequency mo...
NIPS
2004
13 years 10 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
PAMI
2010
13 years 7 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...