2570 search results - page 252 / 514 » Fast Algorithms For The Computation Of Ranklets |
163
click to vote
PAMI
2007
15 years 3 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
114
click to vote
PR
2006
15 years 3 months ago
2006
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...
157
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analys...
103
Voted
ISBI
2008
IEEE
16 years 4 months ago
2008
IEEE
We present a time-lapse collection and reconstruction technique that allows following embryonic heart development at any computationally halted heart contraction state. The centra...
176
Voted
CW
2004
IEEE
15 years 7 months ago
2004
IEEE
This paper presents an approach to realize a tool for interactive and intuitive deformation of 3D shapes. The approach combines a fast algorithm for 3D free form deformation that ...